#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 1e6 + 5, inf = 1e9;
int a[N];
struct num
{
	int v;
	ll c;
	num(int v0 = 0, ll c0 = 0)
	{
		v = v0;
		c = c0;
	}
	num operator + (num p)
	{
		return num(min(p.v, v), (v <= p.v ? c : 0ll) + (p.v <= v ? p.c : 0ll));
	}
	num operator * (num p)
	{
		return num(min(v + p.v, inf), c * p.c);
	}
};
num his[N << 2], now[N << 2], hv[N << 2], nv[N << 2];
void f(int p, num x, num y)
{
	if(x.c)
		his[p] = his[p] + now[p] * x;
	now[p] = now[p] * y;
	if(x.c)
		hv[p] = hv[p] + nv[p] * x;
	nv[p] = nv[p] * y;
}
void push_down(int p)
{
	f(p << 1, hv[p], nv[p]);
	f(p << 1 | 1, hv[p], nv[p]);
	hv[p] = num(inf, 0);
	nv[p] = num(0, 1);
}
void push_up(int p)
{
	now[p] = now[p << 1] + now[p << 1 | 1];
	his[p] = his[p << 1] + his[p << 1 | 1];
}
int sum[N];
void build(int p, int l, int r)
{
	int mid = (l + r) >> 1;
	hv[p] = num(inf, 0);
	nv[p] = num(0, 1);
	if(l == r)
	{
		his[p] = num(1, 0);
		now[p] = num(sum[l], 1);
		return ;
	}
	build(p << 1, l, mid);
	build(p << 1 | 1, mid + 1, r);
	push_up(p);
}
void upd(int p, int l, int r, int ql, int qr, num x, num y)
{
	int mid = (l + r) >> 1;
	if(ql <= l && r <= qr)
	{
		f(p, x, y);
		return ;
	}
	push_down(p);
	if(ql <= mid)
		upd(p << 1, l, mid, ql, qr, x, y);
	if(qr > mid)
		upd(p << 1 | 1, mid + 1, r, ql, qr, x, y);
	push_up(p);
	return ;
}
num qry(int p, int l, int r, int ql, int qr)
{
	int mid = (l + r) >> 1;
	if(ql <= l && r <= qr)
		return his[p];
	push_down(p);
	if(qr <= mid)
		return qry(p << 1, l, mid, ql, qr);
	if(ql > mid)
		return qry(p << 1 | 1, mid + 1, r, ql, qr);
	return qry(p << 1, l, mid, ql, qr) + qry(p << 1 | 1, mid + 1, r, ql, qr);
}
ll ans[N];
int lp[N], rp[N];
vector< pair<int, int> > ad[N], mn[N], qr[N];

int main()
{
	int n, i;
	scanf("%d", &n);
	for(i = 1; i <= 2 * n; i++)
		scanf("%d", a + i);
	for(i = 1; i <= 2 * n; i++)
		if(!lp[a[i]])
			lp[a[i]] = i;
		else
			rp[a[i]] = i;
	for(i = 1; i <= n; i++)
	{
		sum[lp[i]]++;
		sum[rp[i]]--;
	}
	for(i = 1; i <= 2 * n; i++)
		sum[i] += sum[i - 1];
	build(1, 1, 2 * n);
	for(i = 1; i <= 2 * n; i++)
	{
		ad[i].clear();
		mn[i].clear();
		qr[i].clear();
	}
	for(i = 1; i <= n; i++)
	{
		ad[lp[i] + 1].emplace_back(make_pair(rp[i], 2 * n));
		mn[rp[i] + 1].emplace_back(make_pair(rp[i], 2 * n));
		mn[lp[i] + 1].emplace_back(make_pair(lp[i], rp[i] - 1));
		qr[lp[i]].emplace_back(make_pair(lp[i], rp[i] - 1));
	}
	for(i = 1; i <= 2 * n; i++)
	{
		for(auto p: ad[i])
			upd(1, 1, 2 * n, p.first, p.second, num(inf, 0), num(1, 1));
		for(auto p: mn[i])
			upd(1, 1, 2 * n, p.first, p.second, num(inf, 0), num(-1, 1));
		upd(1, 1, 2 * n, 1, 2 * n, num(0, 1), num(0, 1));
		for(auto p: qr[i])
			ans[i] += qry(1, 1, 2 * n, p.first, p.second).c;
	}
	for(i = 0; i <= 2 * n; i++)
		sum[i] = 0;
	for(i = 1; i <= n; i++)
	{
		lp[i] = 2 * n + 1 - lp[i];
		rp[i] = 2 * n + 1 - rp[i];
		swap(lp[i], rp[i]);
		sum[lp[i]]++;
		sum[rp[i]]--;
	}
	for(i = 1; i <= 2 * n; i++)
		sum[i] += sum[i - 1];
	build(1, 1, 2 * n);
	for(i = 1; i <= 2 * n; i++)
	{
		ad[i].clear();
		mn[i].clear();
		qr[i].clear();
	}
	for(i = 1; i <= n; i++)
	{
		ad[lp[i] + 1].emplace_back(make_pair(rp[i], 2 * n));
		mn[rp[i] + 1].emplace_back(make_pair(rp[i], 2 * n));
		mn[lp[i] + 1].emplace_back(make_pair(lp[i], rp[i] - 1));
		qr[lp[i]].emplace_back(make_pair(lp[i], rp[i] - 1));
	}
	for(i = 1; i <= 2 * n; i++)
	{
		for(auto p: ad[i])
			upd(1, 1, 2 * n, p.first, p.second, num(inf, 0), num(1, 1));
		for(auto p: mn[i])
			upd(1, 1, 2 * n, p.first, p.second, num(inf, 0), num(-1, 1));
		upd(1, 1, 2 * n, 1, 2 * n, num(0, 1), num(0, 1));
		for(auto p: qr[i])
			ans[2 * n + 1 - i] += qry(1, 1, 2 * n, p.first, p.second).c;
	}
	for(i = 1; i <= 2 * n; i++)
		printf("%lld ", ans[i]);
	printf("\n");
	return 0;
}