#include <bits/stdc++.h>
using namespace std;
int dp[111111];
int xx[111111];
vector<int> e[111111];
int nowk;
void dfs(int now, int p) {
  int maxnum[2] = {0, 0}, cnt = 0;
  for (int k : e[now])
    if (k != p) {
      dfs(k, now), cnt += dp[k];
      int x = xx[k];
      for (int i = 0; i < 2; i++)
        if (maxnum[i] < x) swap(x, maxnum[i]);
    }
  if (maxnum[0] + maxnum[1] + 1 >= nowk) cnt++, maxnum[0] = -1;
  dp[now] = cnt;
  xx[now] = maxnum[0] + 1;
}
int res[111111];
void solve(int l, int r, int ql, int qr) {
  if (l > r) return;
  if (ql == qr) {
    for (int i = l; i < r + 1; i++) res[i] = ql;
    return;
  }
  int mid = (l + r) / 2;
  nowk = mid;
  dfs(1, 1);
  res[mid] = dp[1];
  solve(l, mid - 1, dp[1], qr), solve(mid + 1, r, ql, dp[1]);
}
int main() {
  int n, a, b;
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &a, &b);
    e[a].push_back(b), e[b].push_back(a);
  }
  solve(1, n, 0, n);
  for (int i = 1; i < n + 1; i++) printf("%d\n", res[i]);
}
