#include<bits/stdc++.h>
using namespace std;
int n;
struct node
{
    int a,b,c,d; 
}e[100001];
int cut(node x,node y)
{
    if(x.a<=y.a)
        if(x.b<=y.b)
            return 0;
    return 1;
}
int cut1(node x,node y)
{
    if(x.c>y.c)
        return 0;
    return 1;
}
int main()
{
    freopen("sunbofu.in","r",stdin);
    freopen("sunbofu.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>e[i].a>>e[i].b;
        e[i].c=i;
    }
    sort(e+1,e+n+1,cut);
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(e[i].a>=e[j].a&&e[i].b>=e[j].b&&e[i].c>e[j].c)
            {
                e[i].d++;
            }
        } 
    } 
    sort(e+1,e+n+1,cut1);
    for(int i=1;i<=n;i++)
    {
        cout<<e[i].d<<endl;
    }
    return 0;
 }