#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<int, int> pii;

const int maxn = 1000100;

int n, a[maxn], ans[maxn], c[maxn], d[maxn];
vector<int> b[maxn];

void dfs(int l, int r) {
	if (l == r) {
		++ans[l];
		return;
	}
	int mid = (l + r) >> 1;
	dfs(l, mid);
	dfs(mid + 1, r);
	for (int i = mid; i <= r + 1; ++i) {
		d[i] = 0;
	}
	for (int i = mid + 1; i <= r; ++i) {
		int j = b[a[i]][0] ^ b[a[i]][1] ^ i;
		if (i < j && j <= r) {
			++d[i];
			--d[j];
		}
		if (j < l || j > r) {
			++d[i];
			--d[r + 1];
		}
	}
	for (int i = mid + 1; i <= r; ++i) {
		d[i] += d[i - 1];
	}
	for (int i = mid + 1; i <= r; ++i) {
		d[i] = d[i - 1] + (!d[i]);
	}
	set<pii> S;
	set<int> T;
	T.insert(r + 1);
	for (int i = l; i <= mid; ++i) {
		c[a[i]] = 0;
		if (b[a[i]][0] == i && mid < b[a[i]][1] && b[a[i]][1] <= r) {
			T.insert(b[a[i]][1]);
		}
	}
	S.emplace(mid + 1, 0);
	// printf("l, r: %d %d\n", l, r);
	for (int i = mid; i >= l; --i) {
		if (b[a[i]][0] == i && mid < b[a[i]][1] && b[a[i]][1] <= r) {
			T.erase(b[a[i]][1]);
		}
		c[a[i]] ^= 1;
		if (c[a[i]]) {
			int j = b[a[i]][0] ^ b[a[i]][1] ^ i;
			// printf("insert %d\n", i);
			if (mid < j && j <= r) {
				S.emplace(j, i);
			} else {
				S.emplace(r + 1, i);
			}
		} else {
			S.erase(mkp(r + 1, b[a[i]][0] ^ b[a[i]][1] ^ i));
		}
		// printf("sz: %d\n", (int)S.size());
		if ((int)S.size() > 1) {
			int l1 = mid + 1, r1 = *T.begin() - 1;
			pii p = *(--S.end()), q = *(----S.end());
			int l2 = q.fst, r2 = p.fst - 1;
			int L = max(l1, l2), R = min(r1, r2);
			if (L <= R) {
				// printf("%d %d %d %d\n", i, p.scd, L, R);
				ans[p.scd] += d[R] - d[L - 1];
			}
		}
	}
	S.clear();
	T.clear();
	for (int i = l - 1; i <= mid + 1; ++i) {
		d[i] = 0;
	}
	for (int i = l; i <= mid; ++i) {
		int j = b[a[i]][0] ^ b[a[i]][1] ^ i;
		if (l <= i && i < j && j <= mid) {
			++d[i + 1];
			--d[j + 1];
		}
		if (j < l || j > r) {
			++d[l];
			--d[i + 1];
		}
	}
	for (int i = l; i <= mid; ++i) {
		d[i] += d[i - 1];
	}
	for (int i = l; i <= mid; ++i) {
		d[i] = d[i - 1] + (!d[i]);
	}
	T.insert(l - 1);
	for (int i = mid + 1; i <= r; ++i) {
		c[a[i]] = 0;
		if (b[a[i]][1] == i && l <= b[a[i]][0] && b[a[i]][0] <= mid) {
			T.insert(b[a[i]][0]);
		}
	}
	S.emplace(mid, 0);
	// printf("l, r: %d %d\n", l, r);
	for (int i = mid + 1; i <= r; ++i) {
		if (b[a[i]][1] == i && l <= b[a[i]][0] && b[a[i]][0] <= mid) {
			T.erase(b[a[i]][0]);
		}
		c[a[i]] ^= 1;
		if (c[a[i]]) {
			int j = b[a[i]][0] ^ b[a[i]][1] ^ i;
			// printf("insert %d\n", i);
			if (l <= j && j <= mid) {
				S.emplace(j, i);
			} else {
				S.emplace(l - 1, i);
			}
		} else {
			S.erase(mkp(l - 1, b[a[i]][0] ^ b[a[i]][1] ^ i));
		}
		if ((int)S.size() > 1) {
			int l1 = *T.rbegin() + 1, r1 = mid;
			pii p = *S.begin(), q = *(++S.begin());
			int l2 = p.fst + 1, r2 = q.fst;
			int L = max(l1, l2), R = min(r1, r2);
			if (L <= R) {
				// printf("%d %d %d %d\n", i, p.scd, L, R);
				ans[p.scd] += d[R] - d[L - 1];
			}
		}
	}
}

void solve() {
	scanf("%d", &n);
	for (int i = 1; i <= n * 2; ++i) {
		scanf("%d", &a[i]);
		b[a[i]].pb(i);
	}
	dfs(1, n * 2);
	for (int i = 1; i <= n * 2; ++i) {
		printf("%d%c", ans[i], " \n"[i == n * 2]);
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}