#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const int Mod = 998244353;
const int inv2 = (Mod+1) / 2;
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, int p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 100;
int fact[fN], invfact[fN], pw2[fN], invpw2[fN];
void initfact(int n){
	pw2[0] = 1; for(int i = 1; i <= n; ++i) pw2[i] = mul(pw2[i-1], 2);
	invpw2[0] = 1; for(int i = 1; i <= n; ++i) invpw2[i] = mul(invpw2[i-1], (Mod+1) / 2);
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
}
int binom(int n, int m){ return mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
inline void chmax(ll &a, ll b){ (b>a) ? (a=b) : 0; }

int n;
vi g[200200];
int dept[200200], bel[200200], sz[200200], rt = 0, rtsz = inf;
void dfs(int u, int par){
	sz[u] = 1;
	int mxsz = 0;
	rep(i, (int)g[u].size()){
		int t = g[u][i];
		if(t == par) continue;
		dept[t] = dept[u] + 1;
		bel[t] = (par == -1 ? t : bel[u]);
		dfs(t, u);
		sz[u] += sz[t];
		mxsz = max(mxsz, sz[t]);
	}
	mxsz = max(mxsz, n - sz[u]);
	if(mxsz < rtsz) rtsz = mxsz, rt = u;
}

int mxdep[200200], ans[200200];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n;
	rep(i, n-1){
		int u, v;
		cin >> u >> v;
		--u, --v;
		g[u].emplace_back(v), g[v].emplace_back(u);
	}

	dfs(0, -1);
	dept[rt] = 0, dfs(rt, -1);

	static int ord[200200];
	rep(i, n) ord[i] = i;
	sort(ord, ord+n, [&](int lh, int rh){ return sz[lh] > sz[rh]; });

	int p = n/2, curans = 0;
	priority_queue< pii > pq;
	pq.emplace(0, -1);
	for(int i = 1; i < n; ++i){
		int u = ord[i];
		while(p > sz[u]) ans[p--] = curans + 1;
		while(pq.top().second >= 0 && pq.top().second == bel[u]) pq.pop();
		curans = max(curans, dept[u] + pq.top().first);
		mxdep[bel[u]] = max(mxdep[bel[u]], dept[u]);
		pq.emplace(mxdep[bel[u]], bel[u]);
	}
	while(p) ans[p--] = curans + 1;

	for(int i = 1; i <= n; ++i)
		if(i & 1)
			cout << "1\n";
		else
			cout << ans[i/2] << "\n";

	return 0;
}