#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
const int maxn = 200005;
int n, cnt, d, g;
int head[maxn], nxt[maxn], to[maxn];
int mx1[maxn], mx2[maxn], dep[maxn], s1[maxn];
int ans[maxn], need[maxn];
queue <int> q;
void add (int u, int v)
{
    nxt[++cnt] = head[u], head[u] = cnt, to[cnt] = v;
}
void dfs1 (int u, int father)
{
    dep[u] = dep[father] + 1;
    mx1[u] = mx2[u] = u;
    for (int e = head[u]; e; e = nxt[e])
        if (to[e] != father) {
            dfs1(to[e], u);
            if (dep[mx1[to[e]]] > dep[mx2[u]])    mx2[u] = mx1[to[e]];
            if (dep[mx2[u]] > dep[mx1[u]])    swap(mx1[u], mx2[u]);
            if (mx1[to[e]] == mx1[u])   s1[u] = to[e];
        }
    int dis = dep[mx1[u]] + dep[mx2[u]] - 2 * dep[u];
    if (dis > d) {
        d = dis;
        g = u;
    }
}
void dfs2 (int u, int father)
{
    dep[u] = dep[father] + 1;
    need[u] = min(need[u], d / 2 - (dep[u] - 1));
    for (int e = head[u]; e; e = nxt[e])
        if (to[e] != father) dfs2(to[e], u);
}
int main ()
{
    scanf("%d", &n);
    for (int i = 2, u, v; i <= n; ++i) {
        scanf("%d%d", &u, &v);
        add(u, v), add(v, u);
    }
    for (int i = 1; i <= n; ++i)    need[i] = n;
    dfs1(1, 0);
    for (int i = n; i > d; --i) ans[i] = n;
    if (d & 1) {
        while (dep[mx1[g]] - dep[g] != d / 2 + 1)   g = s1[g];
        dep[s1[g]] = 0;
        dfs2(g, s1[g]);
        dep[g] = 0;
        dfs2(s1[g], g);
    }
    else {
        while (dep[mx1[g]] - dep[g] != d / 2)   g = s1[g];
        dfs2(g, 0);
    }
    for (int i = 1; i <= n; ++i)    --ans[d - need[i]];
    ++ans[d];
    for (int i = d; i; --i) ans[i] += ans[i + 1];
    for (int i = 1; i <= n; ++i)    printf("%d%c", ans[i], " \n"[i == n]);
    return 0;
}