#include <bits/stdc++.h>
using namespace std;

#define Task "KPATH"
#define sz(x) (int)x.size()
#define bit(x, i) ((x >> i) & 1)
#define sp " "
#define endl "\n"

constexpr int maxn = 3e5 + 5;

int n;
vector<int> g[maxn];
int degcnt[maxn];
int in[maxn];

bool check(vector<int> &u) {
    int k = sz(u);
    for(int x : u) in[x] = 1;
    fill(degcnt + 1, degcnt + n + 1, 0);

    int edge = 0;

    for (auto v : u) {
        for (auto to : g[v]) {
            if (in[to]) {
                edge++;
                degcnt[v]++;
            }
        }
    }
    edge /= 2;

    if(k == 1) return true;
    if(edge != k - 1) return false;

    int tmp = 0;

    for(int v : u) {
        if(degcnt[v] == 1) tmp++;
        else if(degcnt[v] == 2);
        else return false;
    }

           return tmp == 2;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    if(fopen(Task".inp", "r")) {
        freopen(Task".inp", "r", stdin);
        freopen(Task".out", "w", stdout);
    }

    cin >> n;

    for(int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    for(int k = 1; k <= n; k++) {
        vector<int> Pmask;
        for(int mask = 0; mask < (1 << k); mask++) {
            if(__builtin_popcount(mask) != k) continue;

            vector<int> cur;
            for(int i = 1; i <= n; i++) {
                if(bit(mask, i)) {
                    cur.push_back(i);
                }

                if(check(cur)) {
                    Pmask.push_back(mask);
                }
            }
        }

        int m = sz(Pmask);
        int ans = 0;

        for(int mask = 0; mask < (1 << m); mask++) {
            bool isValid = true;
            int cnt = 0;

            for(int i = 0; i < m; i++) {
                if(bit(mask, i)) {
                    if(cnt & Pmask[i]) {
                        isValid = false;
                        break;
                    }
                    cnt |= Pmask[i];
                }
            }

            if(isValid) {
                ans = max(ans, (int)__builtin_popcount(mask));
            }
        }

        cout << ans << endl;
    }

    return 0;
}