#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define fi first
#define se second
#define eb emplace_back
#define popc __builtin_popcount
#define sgn(x) ((x)&1?-1:1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef unsigned long long ull;
typedef long double ld;

int read() {
    int x=0,w=1; char c=getchar(); 
    while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
    while(isdigit(c)) {x=x*10+c-'0'; c=getchar();}
    return x*w;
}

const int N=1e6+9;
int n,a[N],d[N],g[N],sz[N],cnt,ans[N],ft[N],rt1,rt2;
vi e[N];

void dfs(int u,int fa) {
    d[u]=d[fa]+1, sz[u]=1, ft[u]=fa;
    for(int v:e[u]) if(v!=fa) dfs(v,u), sz[u]+=sz[v];
}

signed main() {
    n=read();
    rep(i,2,n) {
        int u=read(), v=read();
        e[u].eb(v), e[v].eb(u);
    }
    dfs(1,0);
    rep(i,1,n) if(d[i]>d[rt1]) rt1=i;
    d[rt1]=0; dfs(rt1,0);
    rep(i,1,n) if(d[i]>d[rt2]) rt2=i;
    int x=rt2;
    while(x) g[++cnt]=x, a[x]=sz[x], x=ft[x];
    per(i,cnt,1) a[g[i]]-=a[g[i-1]];
    int l=1,r=cnt,suml=a[g[1]],sumr=a[g[cnt]];
    rep(k,1,n) {
        if(k%2==1) ans[k]=1;
        else {
            while(suml<k/2) l++, suml+=a[g[l]];
            while(sumr<k/2) r--, sumr+=a[g[r]];
            ans[k]=r-l+1;
        }
    }
    rep(i,1,n) printf("%lld\n",ans[i]);
    return 0;
}