#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
int n,c[101010],ans[101010],maxn;
struct data
{
    int s,e;
}inv[101010];
int lowbit(int x){return x&(-x);}
void add(int i) { while(i<=maxn) {c[i]++;i+=lowbit(i);} }
int sum(int i)
{
    int a=0;
    while(i>0) {a+=c[i];i-=lowbit(i);}
    return a;
}
int main()
{
    scanf("%d",&n);
    memset(c,0,sizeof(c));
    maxn=-1;
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&inv[i].s,&inv[i].e);
        inv[i].s++,inv[i].e++;
        maxn=max(maxn,max(inv[i].s,inv[i].e));
    }
    for(int i=1;i<=n;i++)
    {
        int h=sum(inv[i].s);
        ans[h+1]++;
        add(inv[i].s);
    }
    for(int i=1;i<=n;i++) printf("%d\n",ans[i]);
}