#include <bits/stdc++.h>
using namespace std;

#define ff  first
#define ss  second
#define pb  push_back

const int N = 1e6;
const int mod = 1e9 + 7;
const int oo = N + 5;

typedef pair<int,int>   pii;
typedef long long    ll;

vector <int> g[N];
int fat[N];
pii lson[N];

void dfs (int u) { 
  lson[u] = {1, u};
  for (auto &v : g[u]) { 
    dfs(v);
    lson[u] = max(lson[u], {lson[v].ff + 1, lson[v].ss});
  }
}

int main() {
  #ifdef LOCAL
  freopen("input.txt","r",stdin);
  #endif // LOCAL

  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);

  int n; cin >> n;
  vector <int> a(n);
  for (auto &e : a) cin >> e, e--;

  vector <int> visi(n, 0);
  vector <int> cyc(n, -1);
  vector <vector <int>> sz(n);
  vector <int> ans(n + 1, 0);
  vector <int> pvisi(n, 0);

  int cnt = 0;
  for (int i = 0; i < n; ++i) { 
    if (visi[i]) continue;
    int u = i;
    vector <int> seen;
    while (!visi[u]) { 
      visi[u] = 1;
      seen.pb(u);
      u = a[u];
    }
    if (!pvisi[u]) {
      while (1) { 
        //assert(seen.size());
        cyc[seen.back()] = cnt;
        pvisi[seen.back()]=1;
        if (seen.back() == u) break;
        seen.pop_back();
      }
      cnt++;
    }
    for (auto &e : seen) pvisi[e] = 1;
  }


  for (int i = 0; i < n; ++i) { 
    if (cyc[i] == -1) continue;
    sz[cyc[i]].pb(i);
  }

  for (int i = 0; i < n; ++i) { 
    if (cyc[i] == -1) { 
      fat[i] = a[i];
      g[a[i]].pb(i);
    }
  }

  for (int i = 0; i < n; ++i) { 
    if (cyc[i] != -1) { 
      dfs(i);
    }
  }

  
  

  for (int i = 0; i < cnt; ++i) { 
    pii lrg = {-1,-1};
    for (auto &j : sz[i]) { 
      lrg = max(lrg, {lson[j].ff, j});
    }
    int u = lrg.ss;
    while (a[u] != lrg.ss) { 
      fat[u] = a[u];
      g[a[u]].pb(u);
      cyc[u] = -1;
      u = a[u];
    }
  }

  priority_queue <pii> pq;
  
  vector <int> nzer(n + 1, 0);

  for (int i = 0; i < n; ++i) { 
    if (cyc[i] != -1) { 
      dfs(i);
      pq.push({lson[i].ff, i});
      nzer[(int)sz[cyc[i]].size()]++;
      nzer[lson[i].ff + 1]--;
    }
  }

  for (int i = 1; i <= n; ++i) nzer[i] += nzer[i - 1];

  int curr_size = 0;
  int curr_ans = 0;
  for (int i = 1; i <= n; ++i) { 
    while (curr_size < i) { 
      //cout << "=> " << curr_size << endl;
      pii curr = pq.top(); pq.pop();
      curr_size += curr.ff;


      int son = lson[curr.ss].ss;
      int u = fat[son];

      if (son != curr.ss) {
        int it = 0;
        while (1) {
          it++;
          assert(it <= curr.ff + 20);
          //cout << u << '\n';
          for (auto &v : g[u]) { 
            if (v == son) continue;
            pq.push({lson[v].ff, v});
          }
          if (u == curr.ss) break;
          son = u;
          u = fat[u];
        }
      }

      curr_ans++;
    }
    
    ans[i] = curr_ans - 1;
  }

  for (int i = 1; i <= n; ++i) { 
    if (ans[i] == 0 && nzer[i] == 0) cout << 1 << " ";
    else cout << ans[i] << " ";
  }
  cout << '\n';

  return 0;
}