#include<bits/stdc++.h>
// #include<atcoder/modint>
// #include<atcoder/convolution>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define rs resize
#define ft front()
#define bk back()
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define r0f(i,n) for(int i = n-1; i >= 0; i--)
#define R0F(i,k,n) for(int i = n-1; i >= k; i--)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define SUM(v) (accumulate(all(v), 0LL))
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl
#define dout(a) cout<<a<<' '<<#a<<endl
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl
#define YN(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
#define yn(x); if(x){cout<<"Yes"<<'\n';}else{cout<<"No"<<'\n';}
#define p2(x) (1LL << (x))
#define pct(x) (__builtin_popcountll((x)))
#define ist(x,y) (((x) >> (y)) & 1)
template<class T, class U> bool ckmin(T& a, const U& b) { return (T)b < a ? a = (T)b, 1 : 0; }
template<class T, class U> bool ckmax(T& a, const U& b) { return a < (T)b ? a = (T)b, 1 : 0; }
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
const int mxn = 2e5 + 5, lg = 18;
// mint fact[mxn], inv[mxn];
// mint C(int n, int r){return fact[n] * inv[n-r] * inv[r];}
// mint snb(int n, int r){return C(n + r, n);}
int n, sz[mxn], c, p1 = -1, p2 = -1, up[mxn][lg], par[mxn], dep[mxn]; vi adj[mxn];
void dfs(int node, int from){
par[node] = from; sz[node]=1; for(auto u : adj[node])if(u!=from)dep[u]=dep[node]+1,dfs(u,node),sz[node]+=sz[u];
}
int centroid(int node, int from){
for(auto u : adj[node])if(u!=from)if(sz[u] * 2 > n)return centroid(u,node); return node;
}
int dist(int x, int y){
if(dep[x] > dep[y])swap(x,y); int dif = dep[y]-dep[x]; int ans = 0; f0r(i,lg)if(ist(dif,i))ans += p2(i), y = up[y][i];
r0f(i,lg){
if(up[x][i] != up[y][i])ans += p2(i) * 2, x = up[x][i], y = up[y][i];
} if(x != y)ans += 2; return ans;
}
void put(int x){
if(p1 == -1)p1 = p2 = x; else{
int d = dist(p1, p2); if(dist(p1, x) > d)p2 = x; else if(dist(x, p2) > d)p1 = x;
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
//ifstream cin(".in");
//ofstream cout(".out");
// fact[0]=1;FOR(i,1,mxn)fact[i]=fact[i-1]*i;inv[mxn-1]=fact[mxn-1].inv();r0f(i,mxn-1)inv[i]=inv[i+1]*(i+1);
cin>>n; f0r(i,n-1){in2(a,b); a--; b--; adj[a].pb(b); adj[b].pb(a);} dfs(0,-1); c = centroid(0,-1); dep[c]=0; dfs(c,-1);
f0r(i,n)up[i][0]=par[i]; FOR(j,1,lg)f0r(i,n){if(up[i][j-1]==-1)up[i][j]=-1; else up[i][j]=up[up[i][j-1]][j-1];}
vpii w; f0r(i,n)w.eb(sz[i],i); sort(rall(w)); int ptr = 0;
vi ans(n+1, 1); for(int i = n - (n%2); i >= 2; i-=2){
int k = i / 2; while(ptr < n && w[ptr].F >= k)put(w[ptr].S), ptr++;
ans[i] = dist(p1, p2) + 1;
} FOR(i,1,n+1)cout<<ans[i]<<'\n';
}
