#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ull unsigned long long
#define fi first
#define se second
#define ll long long
#define pb push_back

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());

const int N=1e6+5;
int n,a[N],hs[N],pre[N],suf[N],c[N];
cc_hash_table<ull,int> mp;
ull s=0;
set<pair<int,int> > S[N];
vector<int> V;

void solve(int op=0){
  for(int i=1;i<=n;i++) c[i]=0;
  
  s=0,mp.clear(),mp[0]=0,V.clear();
  for(int r=1,i=0,l=0;r<=n;r++){
    ++c[a[r]];
    if(c[a[r]]==1) V.pb(r);
    
    s^=hs[a[r]];
    
    while(V.size()&&c[a[V.back()]]==2) V.pop_back();
    if(V.size()){
      i=V.back();
      if(mp.find(s^hs[a[i]])!=mp.end()){
        l=mp[s^hs[a[i]]]+1;
        if(!op) S[i].insert({l,r});
        else S[n-i+1].insert({n-r+1,n-l+1});
      }
    }
    
    mp[s]=r;
  }  
}

int main(){
  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  cin>>n;
  for(int i=1;i<=(n<<1);i++) cin>>a[i];
  for(int i=1;i<=n;i++) hs[i]=rd();
  n<<=1;
  
  s=0,mp.clear(),pre[0]=++mp[0];
  for(int i=1;i<=n;i++) s^=hs[a[i]],pre[i]=++mp[s];
  s=0,mp.clear(),suf[n+1]=++mp[0];
  for(int i=n;i>=1;i--) s^=hs[a[i]],suf[i]=++mp[s];

  solve(),reverse(a+1,a+n+1),solve(1);
  
  for(int i=1;i<=n;i++){
    ll res=0;
    for(auto j:S[i]) res+=1ll*pre[j.fi-1]*suf[j.se+1];
    cout<<res<<" \n"[i==n];
  }
  return 0;
}