/*
树状数组,线段树,合并排序
*/
// include file
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <ctime>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <bitset>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <functional>
using namespace std;
// typedef
typedef long long LL;
typedef unsigned long long ULL;
//
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
#define FORi(a,b,c) for(int i=(a);i<(b);i+=c)
#define FORj(a,b,c) for(int j=(a);j<(b);j+=c)
#define FORk(a,b,c) for(int k=(a);k<(b);k+=c)
#define FORp(a,b,c) for(int p=(a);p<(b);p+=c)
#define FORii(a,b,c) for(int ii=(a);ii<(b);ii+=c)
#define FORjj(a,b,c) for(int jj=(a);jj<(b);jj+=c)
#define FORkk(a,b,c) for(int kk=(a);kk<(b);kk+=c)
#define FF(i,a) for(int i=0;i<(a);i++)
#define FFD(i,a) for(int i=(a)-1;i>=0;i--)
#define Z(a) (a<<1)
#define Y(a) (a>>1)
const double eps = 1e-6;
const double INFf = 1e100;
const int INFi = 1000000000;
const LL INFll = (LL)1<<62;
const double Pi = acos(-1.0);
template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T TMAX(T x,T y)
{
if(x>y) return x;
return y;
}
template<class T> inline T TMIN(T x,T y)
{
if(x<y) return x;
return y;
}
template<class T> inline void SWAP(T &x,T &y)
{
T t = x;
x = y;
y = t;
}
template<class T> inline T MMAX(T x,T y,T z)
{
return TMAX(TMAX(x,y),z);
}
template<class T> inline T MMIN(T x,T y,T z)
{
return TMIN(TMIN(x,y),z);
}
// code begin
// 由于星星的出现顺序是排好序的,所以按照每次出现在某点之前有多少个横坐标点,就是多少level
//
int Bit[32010];
int level[15010];
int Nx,N;
char c;
int tmp;
inline int lowBit(int x)
{
return x&(-x);
}
void update(int x,int c)
{
for(int i=x;i<Nx;i+=lowBit(i))
{
Bit[i] += c;
}
}
int getSum(int x)
{
int ans = 0;
for(int i=x;i>0;i-=lowBit(i))
{
ans += Bit[i];
}
return ans;
}
int getnext()
{
do
{
c=getchar();
}while(c<'0'||c>'9');
tmp = 0;
do
{
tmp = tmp*10+c-'0';
c = getchar();
}while(c>='0'&&c<='9');
return tmp;
}
int main()
{
read;
write;
Nx = 32010;
int a,b;
while(scanf("%d",&N)==1)
{
memset(Bit,0,sizeof(Bit));
memset(level,0,sizeof(level));
FORi(0,N,1)
{
//a = getnext();
//b = getnext();
scanf("%d %d",&a,&b);
level[getSum(a+1)]++;
update(a+1,1);
}
FORi(0,N,1)
{
printf("%d\n",level[i]);
}
}
return 0;
}