#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, ans[N], S, f[N], p[N], idx, dp[N];
vector<int> v[N];
void dfs(int pos, int fa) {
  f[pos] = fa;
  for (auto &i : v[pos])
    if (i != fa) dfs(i, pos);
  p[++idx] = pos;
}
int solve(int kk) {
  for (int i = 1; i <= n; i++) dp[i] = 1;
  int ret = 0;
  for (int i = 1; i <= n; i++) {
    int pos = p[i];
    if (f[pos] && dp[pos] != -1 && dp[f[pos]] != -1) {
      if (dp[pos] + dp[f[pos]] >= kk)
        ++ret, dp[f[pos]] = -1;
      else
        dp[f[pos]] = max(dp[f[pos]], dp[pos] + 1);
    }
  }
  return ret;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  S = sqrt(n * log2(n));
  int t1, t2;
  for (int i = 1; i < n; i++) {
    cin >> t1 >> t2;
    v[t1].push_back(t2);
    v[t2].push_back(t1);
  }
  dfs(1, 0);
  ans[1] = n;
  for (int i = 2; i <= S; i++) ans[i] = solve(i);
  int pos;
  for (int i = S + 1; i <= n; i = pos + 1) {
    int l = i, r = n, cur = solve(i);
    pos = -1;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (solve(mid) == cur)
        pos = mid, l = mid + 1;
      else
        r = mid - 1;
    }
    for (int j = i; j <= pos; j++) ans[j] = cur;
  }
  for (int i = 1; i <= n; i++) cout << ans[i] << endl;
  return 0;
}
