#include <bits/stdc++.h>
// #define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
const int N = 3.3e4 + 10;
int a[N], c[N];
int n;
int level[N];
int lowbit(int x) // 返回末尾的1
{
return x & -x;
}
void add(int x, int y)
{
for (int i = x; i < N; i += lowbit(i))
{
c[i] += y;
}
}
long long query(int x)
{
long long sum = 0;
for (int i = x; i; i -= lowbit(i))
{
sum += c[i];
}
return sum;
}
signed main()
{
// IOS;
scanf("%d", &n);
for (int i = 1; i <= n; i ++ )
{
int x, y;
scanf("%d%d", &x, &y);
//树状数组下标必须从1开始
++ x;
//先查询
++level[query(x)];
//后加点
add(x, 1);
}
for (int i = 0; i < n; i ++ )
{
printf("%d\n", level[i]);
}
return 0;
}