#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <array>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <bit>
#include <chrono>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define For(i, a, b) for (ll i = (a); i < (b); i++)
#define debug(...) cerr << __LINE__ << " | ", debug_out(#__VA_ARGS__, __VA_ARGS__)
#define test_only(x, y, ...) do { if ((x) != (y)) { debug(x, y, ##__VA_ARGS__); } } while (0)
#define test_same(x, y, ...) do { if ((x) != (y)) { debug(x, y, ##__VA_ARGS__); abort(); } } while (0)
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long double ld;
template<class T> using P = pair<T, T>;
template<class T> using pri_l = priority_queue<T>;
template<class T> using pri_s = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr int mod1e9 = 1000000007;
constexpr int mod998 = 998244353;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
constexpr ll ten(int n) { return n ? 10 * ten(n - 1) : 1; };
int dx[] = { 1,0,-1,0,1,1,-1,-1,0 }; int dy[] = { 0,1,0,-1,1,-1,1,-1,0 };
ll safe_mul(ll a, ll b, ll LIM = INF) { return (b != 0 && a > LIM / b ? LIM : a * b); }
void fail() { cout << "-1\n"; exit(0); } void no() { cout << "No\n"; exit(0); }
template<class T> void er(T a) { cout << a << '\n'; exit(0); }
template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
template<class T, class U> ostream& operator << (ostream& s, const pair<T, U>& p) { s << p.first << ' ' << p.second; return s; }
template<class T> istream& operator >>(istream& s, vector<T>& v) { for (auto& e : v) s >> e; return s; }
template<class T> ostream& operator <<(ostream& s, const vector<T>& v) { for (auto& e : v) s << e << ' '; return s; }

struct fastio {
	fastio() {
		cin.tie(0); cout.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(20);
		cerr << fixed << setprecision(20);
	}
}fastio_;

namespace rdv {
	random_device seed_gen;
	mt19937_64 engine(seed_gen());
	ll rnum(ll r) { return engine() % r; } // [0, r)
	ll rnum(ll l, ll r) { return rnum(r - l) + l; } // [l, r)
	ll rng(ll l, ll r) { return rnum(l, r + 1); } // [l, r]
	double rng01() { return engine() * pow(2, -64); }
	template<class T> void shuf(vector<T>& v) { shuffle(all(v), engine); }
	void shuf(string& s) { shuffle(all(s), engine); }
}

using namespace rdv;

template<class T> vector<int> compress(vector<T>& v) {
	int n = ssize(v);
	vector<T> tmp = v;
	sort(tmp.begin(), tmp.end());
	tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
	vector<int> res(n);
	for (int i = 0; i < n; i++) res[i] = lower_bound(tmp.begin(), tmp.end(), v[i]) - tmp.begin();
	return res;
}

#ifdef _MSC_VER
using lint = ll;
#else 
using lint = __int128_t;
#endif

#include <atcoder/all>
using namespace atcoder;

constexpr ll mod = mod998;
using mint = static_modint<mod>;

istream& operator >>(istream& s, mint& m) { ll y; s >> y; m = y; return s; }
istream& operator >>(istream& s, vector<mint>& v) { for (auto& e : v) { ll y; s >> y; e = y; } return s; }
ostream& operator <<(ostream& s, const mint& m) { return s << m.val(); }
ostream& operator <<(ostream& s, const vector<mint>& v) { for (auto& e : v) s << e.val() << ' '; return s; }

void debug_out(const char*) { cerr << "\n"; }
template <typename T, typename... Args> void debug_out(const char* names, T value, Args... args) {
	while (*names == ' ') ++names;
	const char* comma = strchr(names, ',');
	if (!comma) { cerr << names << ":" << value << "\n"; }
	else { cerr.write(names, comma - names) << ":" << value << ", "; debug_out(comma + 1, args...); }
}

vector<mint> fac, inv, facinv;

void modcalc(int n) {
	assert(fac.empty()); assert(inv.empty()); assert(facinv.empty());
	fac.resize(n); inv.resize(n); facinv.resize(n);
	fac[0] = 1; fac[1] = 1; inv[1] = 1;
	facinv[0] = 1; facinv[1] = 1;
	for (ll i = 2; i < n; i++) {
		fac[i] = fac[i - 1] * i;
		inv[i] = -inv[mod % i] * (mod / i);
		facinv[i] = facinv[i - 1] * inv[i];
	}
}

mint comb(ll n, ll k) {
	if (n < 0 or k < 0 or n < k) return 0;
	return fac[n] * facinv[k] * facinv[n - k];
}

mint perm(ll n, ll k) {
	if (n < 0 or k < 0 or n < k) return 0;
	return fac[n] * facinv[n - k];
}

mint hom(ll n, ll k) {
	if (n < 0 or k < 0 or (n == 0 && k > 0)) return 0;
	if (n == 0 && k == 0) return 1;
	return fac[n + k - 1] * facinv[k] * facinv[n - 1];
}

template <class S, auto op, auto e, class F, auto mapping, auto composition, auto id> struct segtree_beats {
	static_assert(is_convertible_v<decltype(op), function<S(S, S)>>, "op must work as S(S, S)");
	static_assert(is_convertible_v<decltype(e), function<S()>>, "e must work as S()");
	static_assert(is_convertible_v<decltype(mapping), function<S(F, S)>>, "mapping must work as F(F, S)");
	static_assert(is_convertible_v<decltype(composition), function<F(F, F)>>, "compostiion must work as F(F, F)");
	static_assert(is_convertible_v<decltype(id), function<F()>>, "id must work as F()");
public:
	segtree_beats() : segtree_beats(0) {}
	explicit segtree_beats(int n) : segtree_beats(vector<S>(n, e())) {}
	explicit segtree_beats(const vector<S>& v) : _n(ssize(v)) {
		size = bit_ceil<uint>(_n);
		log = countr_zero<uint>(size);
		d = vector<S>(2 * size, e()), lz = vector<F>(size, id());
		for (int i = 0; i < _n; i++) d[size + i] = v[i];
		for (int i = size - 1; i >= 1; i--) update(i);
	}
	void set(int p, S x) {
		assert(0 <= p && p < _n);
		p += size;
		for (int i = log; i >= 1; i--) push(p >> i);
		d[p] = x;
		for (int i = 1; i <= log; i++) update(p >> i);
	}
	S get(int p) {
		assert(0 <= p && p < _n);
		p += size;
		for (int i = log; i >= 1; i--) push(p >> i);
		return d[p];
	}
	S prod(int l, int r) {
		assert(0 <= l && l <= r && r <= _n);
		if (l == r) return e();
		l += size; r += size;
		for (int i = log; i >= 1; i--) {
			if (((l >> i) << i) != l) push(l >> i);
			if (((r >> i) << i) != r) push((r - 1) >> i);
		}
		S sml = e(), smr = e();
		while (l < r) {
			if (l & 1) sml = op(sml, d[l++]);
			if (r & 1) smr = op(d[--r], smr);
			l >>= 1; r >>= 1;
		}
		return op(sml, smr);
	}
	S all_prod() { return d[1]; }
	void apply(int p, F f) {
		assert(0 <= p && p < _n);
		p += size;
		for (int i = log; i >= 1; i--) push(p >> i);
		d[p] = mapping(f, d[p]);
		for (int i = 1; i <= log; i++) update(p >> i);
	}
	void apply(int l, int r, F f) {
		assert(0 <= l && l <= r && r <= _n);
		if (l == r) return;
		l += size; r += size;
		for (int i = log; i >= 1; i--) {
			if (((l >> i) << i) != l) push(l >> i);
			if (((r >> i) << i) != r) push((r - 1) >> i);
		}
		{
			int l2 = l, r2 = r;
			while (l < r) {
				if (l & 1) all_apply(l++, f);
				if (r & 1) all_apply(--r, f);
				l >>= 1; r >>= 1;
			}
			l = l2; r = r2;
		}
		for (int i = 1; i <= log; i++) {
			if (((l >> i) << i) != l) update(l >> i);
			if (((r >> i) << i) != r) update((r - 1) >> i);
		}
	}
	template <bool (*g)(S)> int max_right(int l) { return max_right(l, [](S x) { return g(x); }); }
	template <class G> int max_right(int l, G g) {
		assert(0 <= l && l <= _n); assert(g(e()));
		if (l == _n) return _n;
		l += size;
		for (int i = log; i >= 1; i--) push(l >> i);
		S sm = e();
		do {
			while (l % 2 == 0) l >>= 1;
			if (!g(op(sm, d[l]))) {
				while (l < size) {
					push(l);  l = 2 * l;
					if (g(op(sm, d[l]))) { sm = op(sm, d[l]); l++; }
				}
				return l - size;
			}
			sm = op(sm, d[l]); l++;
		} while ((l & -l) != l);
		return _n;
	}
	template <bool (*g)(S)> int min_left(int r) { return min_left(r, [](S x) { return g(x); }); }
	template <class G> int min_left(int r, G g) {
		assert(0 <= r && r <= _n); assert(g(e()));
		if (r == 0) return 0;
		r += size;
		for (int i = log; i >= 1; i--) push((r - 1) >> i);
		S sm = e();
		do {
			r--;
			while (r > 1 && (r % 2)) r >>= 1;
			if (!g(op(d[r], sm))) {
				while (r < size) {
					push(r); r = 2 * r + 1;
					if (g(op(d[r], sm))) { sm = op(d[r], sm); r--; }
				}
				return r + 1 - size;
			}
			sm = op(d[r], sm);
		} while ((r & -r) != r);
		return 0;
	}
private:
	int _n, size, log;
	vector<S> d; vector<F> lz;
	void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
	void all_apply(int k, F f) {
		d[k] = mapping(f, d[k]);
		if (k < size) lz[k] = composition(f, lz[k]);
		if (d[k].fail) { push(k); update(k); }
	}
	void push(int k) {
		all_apply(2 * k, lz[k]);
		all_apply(2 * k + 1, lz[k]);
		lz[k] = id();
	}
};

struct S {
	ll sum, mn, mn2, mncnt;
	bool fail;
};

S op(S a, S b) {
	S res;
	res.sum = a.sum + b.sum;
	res.mn = min(a.mn, b.mn);
	if (a.mn < b.mn) {
		res.mn2 = min(a.mn2, b.mn);
		res.mncnt = a.mncnt;
	}
	else if (a.mn == b.mn) {
		res.mn2 = min(a.mn2, b.mn2);
		res.mncnt = a.mncnt + b.mncnt;
	}
	else {
		res.mn2 = min(a.mn, b.mn2);
		res.mncnt = b.mncnt;
	}
	res.fail = false;
	return res;
}

S e() {
	return { 0, inf, inf, 0, false };
}

using F = ll;

S mapp(F f, S a) {
	if (a.mn >= f) return a;
	if (a.mn2 > f) {
		a.sum += (f - a.mn) * a.mncnt;
		a.mn = f;
		return a;
	}
	a.fail = true;
	return a;
}

F comp(F f, F g) { return max(f, g); }
F id() { return -inf; }

int main() {

	[[maybe_unused]] bool DEBUG = false;

	int TEST = 1;
	// cin >> TEST;
	while (TEST--) {
		int n;
		cin >> n;
		vector<int> a(n);
		cin >> a;
		rep(i, n) chmin(a[i], n);
		vector pos(n + 1, vector<int>());
		rep(i, n) pos[a[i]].push_back(i);
		vector<ll> f(n + 2); // mex < i

		/*vector<int> p(n);
		rep(i, n) p[i] = i;*/

		vector<S> init(n);
		rep(i, n) init[i] = { i, i, inf, 1, false };

		segtree_beats<S, op, e, F, mapp, comp, id> seg(init);
		rep(i, n + 1) {
			int L = 0;
			for (int w : pos[i]) {
				// For(j, L, w + 1) chmax(p[j], w);
				seg.apply(L, w + 1, w);
				L = w + 1;
			}
			// For(j, L, n) chmax(p[j], n);
			seg.apply(L, n, n);
			f[i + 1] = seg.all_prod().sum;
			f[i + 1] -= ll(n) * (n - 1) / 2;
		}

		rep(i, n + 1) cout << f[i + 1] - f[i] << '\n';
	}
}