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

using isize = size_t;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
using f64 = long double;
using p2 = pair<i64, i64>;
using el = tuple<i64, i64, i64>;
using mint = atcoder::modint998244353;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(18);
  _main();
}

i64 pow(i64 x, i64 n) {
  i64 res = 1;
  i64 t = x;
  while (n > 0) {
    if (n & 1) res *= t;
    t *= t;
    n >>= 1;
  }
  return res;
}

i64 op(i64 a, i64 b) {return a + b;}
i64 e() {return 0;}
void _main() {
  i64 n;
  cin >> n;
  vector<i64> a(n);
  vector<i64> pre(n, -1);
  vector<i64> mx(n, -1);
  vector<p2> ord;
  for (i64 i = 0; i < n; i++) {
    cin >> a[i];
    a[i]--;
    pre[i] = mx[a[i]];
    mx[a[i]] = i;
    ord.push_back({pre[i], i});
  }
  vector<i64> ans(n + 1, 0);
  sort(ord.begin(), ord.end());
  i64 id = 0;
  atcoder::segtree<i64, op, e> seg(n);
  priority_queue<p2, vector<p2>, greater<p2>> que;
  for (i64 i = 1; i <= n; i++) que.push({0, i});
  for (i64 i = 0; i < n; i++) {
    while (id < ord.size() && ord[id].first < i) {
      seg.set(ord[id].second, seg.get(ord[id].second) + 1);
      id++;
    }
    while (!que.empty() && que.top().first == i) {
      i64 k = que.top().second;
      que.pop();
      i64 lim = seg.max_right(i, [&](i64 t){return t <= k;});
      ans[k]++;
      que.push({lim, k});
    }
  }
  for (i64 i = 1; i <= n; i++) {
    cout << ans[i] << "\n";
  }
}