#include <bits/stdc++.h>
using namespace std;
const int N=100000+5;
const int M=1000000+5;
struct sdf{
    int a,b,id;
}p[N];
int n,m=0;
int ans[N]={0},l[M]={0};
bool cmp(sdf x,sdf y){
    if (x.a!=y.a)return x.a<y.a;
    if (x.b!=y.b)return x.b<y.b;
    return x.id>y.id;
}
int lowbit(int x){
    return x&(-x);
}
void add(int x,int y){
    for (int i=x;i<=m;i+=lowbit(i)){
        l[i]+=y;
    }
    return ;
}
int getsum(int x){
    int t=0;
    for (int i=x;i>0;i-=lowbit(i)){
        t+=l[i];
    }
    return t;
}
int main(){
    freopen ("sunbofu.in","r",stdin);
    freopen ("sunbofu.out","w",stdout);
    scanf("%d",&n);
    for (int i=1;i<=n;i++){
        scanf("%d%d",&p[i].a,&p[i].b);
        m=max(m,p[i].b);p[i].id=i;
    }
    sort(p+1,p+n+1,cmp);
    for (int i=1;i<=n;i++){
        ans[p[i].id]=getsum(p[i].b);
        add(p[i].b,1);
    }
    for (int i=1;i<=n;i++){
        printf("%d\n",ans[i]);
    }
    return 0;
}