#include <cstdio>
#include <random>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <cstring>

typedef unsigned long long ull;
std::mt19937_64 rnd(19410622);
std::unordered_multiset<int> tab;
std::set<int> s;
int a[1000005], b[1000005], ans1[1000005], ans2[1000005], lst[500005], n;
ull hsh[1000005];
void solve(int *ans) {
	s.clear(), tab.clear(), tab.insert(0), memset(lst, 0, sizeof lst);
	for (int i = 1; i <= n + n; ++ i) {//r=i;
		hsh[i] = hsh[i - 1] ^ b[a[i]];
		if (lst[a[i]]) s.erase(lst[a[i]]);
		else s.insert(i), lst[a[i]] = i;
		if (s.size()) {
			int x = *-- s.end();
			ans[x] += tab.count(hsh[i] ^ b[a[x]]);
		}
		tab.insert(hsh[i]);
	}
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++ i) b[i] = rnd();
	for (int i = 1; i <= n + n; ++ i) scanf("%d", a + i);
	solve(ans1), std::reverse(a + 1, a + n + 1), solve(ans2);
	for (int i = 1; i <= n + n; ++ i) printf("%d ", ans1[i] + ans2[n + n + 1 - i]);
	return 0;
}