#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")

#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>

#define pb push_back
#define F first
#define S second
#define lll long long
#define lld long double

#define data sdadsd

//#define int lll

using namespace std;
using namespace __gnu_pbds;

template <typename T>
using ordered_set = tree <T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

mt19937 gen(chrono::system_clock::now().time_since_epoch().count());

const int N = 2e5 + 123;
const int M = 1e9 + 7;
const int mod = 998244353;
const int rx[4] = {0, 0, -1, 1};
const int ry[4] = {-1, 1, 0, 0};
const lld eps = 1e-11;
const double pi = acos(-1.0);
const int kx[8] = {1, 1, -1, -1, 2, 2, -2, -2};
const int ky[8] = {2, -2, 2, -2, 1, -1, 1, -1};

int a[N];

unordered_map < int, bool > u;

int calc[N];

int prec[N];

main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    srand(time(0));
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
//    freopen("pizza.in", "r", stdin);
//    freopen("pizza.out", "w", stdout);
#endif
     lll res = 0;
     int n;
     cin >> n;
     unordered_map < int, int > last;
     for (int i = 0; i < n; ++i) {
          cin >> a[i];
          if (!last.count(a[i])) {
               prec[i] = 1e9;
          } else {
               prec[i] = i - last[a[i]];
          }
          last[a[i]] = i;
     }
     for (int i = n - 1; i >= 0; --i) {
          calc[i] = calc[i + 1];
          calc[i] += (!u[a[i]]);
          u[a[i]] = 1;
     }
     ordered_set < pair < int, int > > all;
     for (int i = 0; i < n; ++i) {
          all.insert({prec[i], i});
     }
     int add;
     for (int i = 1; i <= n; ++i) {
          if (i == 1) {
               res = n;
          } else {
               res -= calc[n - i + 1];
               add = int(all.size()) - all.order_of_key({i, 1});
//               cout << i << ' ' << add << endl;
               res += add;
          }
          cout << res << ' ';
          all.erase({prec[i - 1], i - 1});
     }
     return 0;
}