#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
double cur = rngesus(0, MASK(60) - 1);
cur /= MASK(60) - 1;
return l + cur * (r - l);
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int N = 2e5 + 69;
int n;
vector<int> graph[N];
int h[N], parent[N];
void dfs(int u, int p){
parent[u] = p;
for(int v: graph[u]) if (v != p){
h[v] = h[u] + 1;
dfs(v, u);
}
}
int find_sz(int u, int p){
int ans = 1;
for(int v: graph[u]) if (v != p){
ans += find_sz(v, u);
}
return ans;
}
void solve(){
cin >> n;
for(int i = 1; i < n; ++i){
int u, v; cin >> u >> v;
graph[u].push_back(v);
graph[v].push_back(u);
}
dfs(1, 0);
pair<int, int> ma = {-1, -1};
for(int i = 1; i <= n; ++i)
maximize(ma, make_pair(h[i], i));
int u = ma.second;
dfs(u, 0);
ma = {-1, -1};
for(int i = 1; i <= n; ++i)
maximize(ma, make_pair(h[i], i));
int v = ma.second;
vector<int> chain;
vector<bool> on_chain(n+1);
while(v != 0){
chain.push_back(v);
on_chain[v] = true;
v = parent[v];
}
vector<int> sigma;
for(int i = 0; i < (int) chain.size(); ++i){
sigma.push_back(i);
int u = chain[i];
for(int v: graph[u]) if (!on_chain[v]){
int cur = find_sz(v, u);
while(cur--) sigma.push_back(i);
}
}
vector<int> ans(n+1, 1);
int l = 0, r = n-1;
for(int i = 2; i <= n; i += 2){
ans[i] = sigma[r] - sigma[l] + 1;
l++; r--;
}
for(int i = 1; i <= n; ++i)
cout << ans[i] << " ";
cout << "\n";
}
int main(void){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
clock_t start = clock();
solve();
cerr << "Time elapsed: " << clock() - start << " ms\n";
return 0;
}
