#include <bits/stdc++.h>
#define fi first
#define se second
#define all(v) v.begin() , v.end()
#define sz(v) int(v.size())
#define unq(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
using namespace std;

typedef long long ll;
typedef pair<int , int> ii;
typedef pair<long long , int> lli;

const int maxN = int(2e5)+7;

int n;
vector<int> g[maxN] , adj[maxN];
int max_d[maxN] , p[maxN] , cnt[maxN];

void dfs(int u){
    max_d[u] = 0;
    for (int v : g[u]){
        if (v != p[u]){
            p[v] = u;
            adj[u].push_back(v);
            dfs(v);
            max_d[u] = max(max_d[u] , max_d[v] + 1);
        }
    }
}

void solve(){
    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);
    }
    p[0] = -1;
    dfs(0);
    for (int i = 0 ; i < n ; i++){
        sort(all(adj[i]) , [](int x , int y){
             return max_d[x] > max_d[y];
        });
    }
    set<ii> st;
    st.insert({-max_d[0] , 0});
    int ans = 0;
    while (st.empty() == 0){
        int u = st.begin()->se;
        st.erase(st.begin());
        ans++;
        while (true){
            if (u != 0) cout << ans << " ";
            if (sz(adj[u]) == 0) break;
            for (int i = 1 ; i < sz(adj[u]) ; i++){
                int v = adj[u][i];
                st.insert({-max_d[v] , v});
            }
            u = adj[u][0];
        }
    }
}

#define name "A"

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(name".INP" , "r")){
        freopen(name".INP" , "r" , stdin);
        freopen(name".OUT" , "w" , stdout);
    }
    int t = 1; //cin >> t;
    while (t--) solve();
    return 0;
}