#include<bits/stdc++.h>
using namespace std;
const int N=5e5+5;
int n,t,siz[N],maxp[N],rt;
bool vis[N];
vector<int> to[N];
int anssiz[N],nanssiz[N],ans[N];
void findrt(int x,int all,int f)
{
    siz[x]=1; maxp[x]=0;
    for(int v:to[x])
    {
        if(v==f||vis[v]) continue;
        findrt(v,all,x);
        siz[x]+=siz[v];
        maxp[x]=max(maxp[x],siz[v]);
    }
    maxp[x]=max(maxp[x],all-siz[x]);
    if(rt==0||maxp[x]<maxp[rt]) rt=x;
}
void work(int x,int f,int ndep)
{
    nanssiz[siz[x]]=max(nanssiz[siz[x]],ndep);
    for(int v:to[x])
    {
        if(vis[v]||v==f) continue;
        work(v,x,ndep+1);
    }
}
void getsiz(int x,int f)
{
    siz[x]=1;
    for(int v:to[x])
    {
        if(vis[v]||v==f) continue;
        getsiz(v,x); siz[x]+=siz[v];
    }
}
void calc(int x)
{
    for(int v:to[x])
    {
        if(vis[v]) continue;
        work(v,x,1);
        for(int i=siz[v];i>=1;i--)
        {
            nanssiz[i]=max(nanssiz[i],nanssiz[i+1]);
            if(nanssiz[i]==0) continue;
            if(anssiz[i]) ans[i]=max(ans[i],anssiz[i]+nanssiz[i]+1);
            anssiz[i]=max(anssiz[i],nanssiz[i]);
        }
        for(int i=1;i<=siz[v];i++)
            nanssiz[i]=0;
        int ans2=min(siz[v],siz[x]-siz[v]);
        for(int i=ans2;i>=1;i--) ans[i]=max(ans[i],2);
    }
    for(int i=1;i<=siz[x];i++) anssiz[i]=0;
}
void solve(int x)
{
    rt=0;
    findrt(x,siz[x],0); getsiz(rt,0); vis[rt]=1;
    calc(rt);
    for(int v:to[rt]) if(!vis[v]) solve(v);
}
void solve()
{
    cin>>n;
    for(int u,v,i=1;i<n;i++)
    {
        cin>>u>>v;
        to[u].push_back(v);
        to[v].push_back(u);
    }
    for(int i=1;i<=n;i++) ans[i]=1;
    siz[1]=n; solve(1);
    for(int i=1;i<=n;i++)
        if(i&1) cout<<"1\n";
        else cout<<ans[i/2]<<'\n';
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    // cin>>t;
    t=1;
    while(t--) solve();
}