#include<bits/stdc++.h>

#define pii pair<int,int>

#define F first

#define S second

using namespace std;

const int maxn=;

vector<int>G1[maxn],G2[maxn];

pii p1[maxn],p2[maxn];

int dfn[maxn],low[maxn],scc[maxn],scc_cnt,sz[maxn],ind[maxn];

int q[maxn],head,tail,times,ans[maxn],res[maxn],instk[maxn];

map<pii,int>mp;

void tarjan(int u)

{

    instk[u]=; q[++head]=u;

    dfn[u]=low[u]=++times;

    for(int i=;i<G1[u].size();i++){

        int v=G1[u][i];

        if(!dfn[v]) {

            tarjan(v);

            low[u]=min(low[u],low[v]);

        }

        else if(instk[v])low[u]=min(low[u],dfn[v]);//无向图与有向图的区别

    }

    if(dfn[u]==low[u]){

        scc_cnt++;

        while(true){

             int x=q[head--];

             scc[x]=scc_cnt; sz[scc_cnt]++;

             instk[x]=;

             if(x==u) break;

        }

    }

}

int main()

{

    int N,i,j;

    scanf("%d",&N);

    for(i=;i<=N;i++) scanf("%d%d",&p1[i].F,&p2[i].F),p1[i].S=p2[i].S=i;

    sort(p1+,p1+N+);

    sort(p2+,p2+N+);

    for(i=;i<=N;i++) G1[p1[i].S].push_back(p1[i-].S);

    for(i=;i<=N;i++) G1[p2[i].S].push_back(p2[i-].S);

    for(i=;i<=N;i++) if(!dfn[i]) tarjan(i);

    for(i=;i<=N;i++){

        int L=G1[i].size();

        for(j=;j<L;j++){

            if(scc[i]!=scc[G1[i][j]]&&!mp[make_pair(scc[G1[i][j]],scc[i])]) mp[make_pair(scc[G1[i][j]],scc[i])]=,G2[scc[G1[i][j]]].push_back(scc[i]),ind[scc[i]]++;

        }

    }

    head=tail=;

    for(i=;i<=scc_cnt;i++) if(ind[i]==) q[++head]=i;

    while(tail<head){

        int u=q[++tail];

        int L=G2[u].size();

        for(j=;j<L;j++){

            sz[G2[u][j]]+=sz[u];

            if((--ind[G2[u][j]])==) q[++head]=G2[u][j];

        }

    }

    for(i=;i<=N;i++) printf("%d\n",sz[scc[i]]-);

    return ;

}