#include<bits/stdc++.h>
#define N 1000005 
#define ull unsigned long long
#define gc (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) ? EOF : *p1 ++)
using namespace std;
char buf[100000], *p1, *p2;
inline int read(){
	char ch;
	int x = 0;
	while ((ch = gc) < 48);
	do x = x * 10 + ch - 48; while ((ch = gc) >= 48);
	return x;
}
int n,a[N],b[N],c[N];
ull shift(ull x){
	x^=(x<<11);
	x^=(x>>4);
	x^=(1<<5);
	x^=(1>>14);
	return x;
}
ull s[N];
set<int > st;
unordered_map<int ,int > mp;
long long ans[N];
int main(){
	n=read();
	for(int i=1;i<=2*n;i++){
		a[i]=read();
		if(c[a[i]]) b[c[a[i]]]=i,b[i]=c[a[i]];
		c[a[i]]=i;
	}
	for(int i=1;i<=2*n;i++) s[i]=s[i-1]^shift(a[i]);
	for(int i=1;i<=2*n;i++){
		mp[s[i-1]]++;
		if(i<b[i]) st.insert(i);
		else st.erase(b[i]);
		if(!st.empty()){
			auto it=st.end();it--;
			ans[*it]+=mp[s[i]^shift(a[*it])];
		}
	}
	mp.clear();st.clear();
	for(int i=2*n;i>=1;i--){
		mp[s[i]]++;
		if(i>b[i]) st.insert(i);
		else st.erase(b[i]);
		if(!st.empty()){
			auto it=st.begin();
			ans[*it]+=mp[s[i-1]^shift(a[*it])];
		}
	}
	for(int i=1;i<=2*n;i++) printf("%lld ",ans[i]);
}