#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define eb emplace_back
const int N=1e6+5;
mt19937_64 rand1(0);
int n,a[N],b[N],nw[N];ll ans[N];ull s[N],w[N];
set<int> z;unordered_map<ull,int> mp;
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;++i) w[i]=rand1();
    for(int i=1;i<=n*2;++i) scanf("%d",&a[i]);
	for(int i=1;i<=n;++i) a[i]=a[n+i]=i;
    for(int i=1;i<=n*2;++i)
    {int &t=nw[a[i]];if(t) b[i]=t,b[t]=i;t=i;}
    for(int i=1;i<=n*2;++i) s[i]=s[i-1]^w[a[i]];
    for(int i=1,t;i<=n*2;++i)
    {
        ++mp[s[i-1]];
        if(i<b[i]) z.insert(i);else z.erase(b[i]);
        if(!z.empty())
        {
            t=*prev(z.end());
            ans[t]+=mp[s[i]^w[a[t]]];
        }
    }
    z.clear();mp.clear();
    for(int i=n*2,t;i;--i)
    {
        ++mp[s[i]];
        if(i>b[i]) z.insert(i);else z.erase(b[i]);
        if(!z.empty())
        {            
            t=*z.begin();
            ans[t]+=mp[s[i-1]^w[a[t]]];
        }
    }
    for(int i=1;i<=n*2;++i) printf("%lld ",ans[i]);
    return 0;
}