#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int op(int a, int b) { return a + b; }
int e() { return 0; }
int target;
bool f(int x) { return x <= target; }
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<vector<int>>g(n);
	vector<int>a(n);
	rep(i, n) {
		cin >> a[i], a[i]--;
		g[a[i]].push_back(i);
	}
	vector<int>ans(n, 1);
	segtree<int, op, e>seg(n);
	rep(i, n) {
		reverse(all(g[i]));
		if (g[i].empty())continue;
		seg.set(g[i].back(), 1);
	}
	vector<vector<int>>h(n);
	rep(i, n)h[0].push_back(i);
	rep(i, n) {
		sort(all(h[i]));
		for (auto e : h[i]) {
			target = e + 1;
			int r = seg.max_right<f>(i);
			if (r != n) {
				ans[e]++;
				h[r].push_back(e);
			}
		}
		g[a[i]].pop_back();
		if (!g[a[i]].empty()) seg.set(g[a[i]].back(), 1);
	}
	rep(i, n)cout << ans[i] << endl;
	return 0;
}