#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,l[20005],r[200005];
int p[400005],sum[400005];
int ans[200005];
int h[400005],g[400005],f[400005];
void sol()
{
	memset(p,0x3f,sizeof(p));
	memset(sum,0,sizeof(sum));
	for(int i=1;i<=n;i++)
	{
		p[r[i]]=l[i];
		sum[r[i]]++;
	}
	for(int i=1;i<=n+n;i++)
		sum[i]+=sum[i-1];
	for(int i=n+n;i>=1;i--)
		p[i]=min(p[i],p[i+1]);
	for(int i=1;i<=n+n;i++)
	{
		if(p[i]>=i)
		{
			g[i]=i;
			f[i]=h[i]=0;
		}
		else
		{
			g[i]=g[p[i]];
			h[i]=h[p[i]]+1;
			f[i]=sum[i-1]+f[p[i]];
		}
	}
	for(int i=1;i<=n;i++)
	{
		int x=p[l[i]];
		ans[i]+=f[l[i]];
		ans[i]-=sum[g[x]-1]*(h[l[i]]);
	}
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>l[i]>>r[i],ans[i]=n-1;
	sol();
	for(int i=1;i<=n;i++)
	{
		l[i]=n+n+1-l[i];
		r[i]=n+n+1-r[i];
		swap(l[i],r[i]);
	}
	sol();
	for(int i=1;i<=n;i++)
		cout<<ans[i]<<'\n';
}