#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],sz[N],cnt,ans[N],msz[N],rt,tp,g[N],mx[N];
vi e[N];

void dfs(int u,int fa,int tp) {
    sz[u]=1;
    for(int v:e[u]) if(v!=fa) d[v]=d[u]+1, dfs(v,u,tp), sz[u]+=sz[v], msz[u]=max(msz[u],sz[v]);
    msz[u]=max(msz[u],n-sz[u]);
    if(tp&&(!rt||msz[u]<msz[rt])) rt=u;
}
void dfs2(int u,int fa) {
    g[sz[u]]=max(g[sz[u]],d[u]);
    for(int v:e[u]) if(v!=fa) dfs2(v,u);
}

signed main() {
    n=read();
    rep(i,2,n) {
        int u=read(), v=read();
        e[u].eb(v), e[v].eb(u);
    }
    dfs(1,0,1); d[rt]=0;
    dfs(rt,0,0);
    rep(i,1,n) ans[i]=1;
    int msz=0;
    for(int u:e[rt]) {
        rep(i,1,sz[u]) g[i]=0;
        dfs2(u,rt);
        per(i,sz[u],1) g[i]=max(g[i],g[i+1]);
        rep(k,1,min(msz,sz[u])) ans[2*k]=max(ans[2*k],g[k]+mx[k]+1);
        rep(k,1,min(sz[u],n-sz[u])) ans[2*k]=max(ans[2*k],g[k]+1);
        msz=max(sz[u],msz);
        rep(i,1,sz[u]) mx[i]=max(mx[i],g[i]);
    }
    rep(i,1,n) printf("%lld\n",ans[i]);
    return 0;
}