#include <bits/stdc++.h>

using namespace std;

namespace FastRead{
	char buf[1000005], *s = buf, *t = buf, ch, f;
	#define gc() s == t && (t = (s = buf) + fread(buf, 1, 1000000, stdin), s == t) ? EOF : *s ++ 
	template <typename T>
	inline void Read(T &x)
	{
		x = f = 0, ch = gc();
		while(ch < '0' || ch > '9') f = ch == '-', ch = gc();
		while('0' <= ch && ch <= '9') x = x * 10 + ch - 48, ch = gc();
		f && (x = -x);
	}
};
using FastRead::Read;

typedef unsigned long long ULL;

const int N = 1e6 + 5;

int n, a[N], vis[N];
mt19937_64 mrand(72346070);
ULL val[N], s[N];
unordered_multiset<ULL> st;
int fa[N];
vector<int> pos[N];
long long res[N];

inline int gfa(int i)
{
	return i == fa[i] ? i : (fa[i] = gfa(fa[i]));
}

inline void Work()
{
	for(int i = 1; i <= n * 2 + 1; i ++ ) fa[i] = i, pos[i].clear();
	for(int i = 1; i <= n * 2; i ++ )
	{
		s[i] = s[i - 1] ^ val[a[i]];
		if(vis[a[i]])
		{
			for(int j = gfa(vis[a[i]] + 1); j <= i; j = gfa(j))
			{
				pos[i].push_back(j);
				fa[j] = j + 1;
			}
		}
		vis[a[i]] ^= i;
	}
	
	st.clear();
	for(int i = n * 2; i >= 1; i -- )
	{
		st.insert(s[i]);
		if(vis[a[i]] != i)
		{
			for(int j : pos[i])
			{
				res[i] += st.count(s[j - 1] ^ val[a[i]]);
			}
		}
		vis[a[i]] ^= i;
	}
}

int main()
{
	Read(n);
	for(int i = 1; i <= n; i ++ ) val[i] = mrand();
	for(int i = 1; i <= n * 2; i ++ ) Read(a[i]);
	Work();
	reverse(a + 1, a + n * 2 + 1);
	reverse(res + 1, res + n * 2 + 1);
	Work();
	reverse(res + 1, res + n * 2 + 1);
	for(int i = 1; i <= n * 2; i ++ ) printf("%lld ", res[i]);
	puts("");
}