1 //2016.8.10
 2 //树状数组，区间更新，单点查询
 3 #include<iostream>
 4 #include<cstdio>
 5 #include<cstring>
 6 
 7 using namespace std;
 8 
 9 int arr[100005], n;
10 
11 int lowbit(int x){return x&(-x);}
12 
13 int add(int pos, int tt)
14 {
15     for(int i = pos; i > 0; i-=lowbit(i))
16       arr[i] += tt;
17     return 0;
18 }
19 
20 int query(int pos)
21 {
22     int sum = 0; 
23     for(int i = pos; i <= n; i+=lowbit(i))
24       sum+=arr[i];
25     return sum;
26 }
27 
28 int main()
29 {
30     int a, b;
31     while(cin>>n)
32     {
33         memset(arr, 0, sizeof(arr));
34         for(int i = 0; i < n; i++)
35         {
36             scanf("%d%d", &a, &b);
37             add(b, 1);
38             add(a-1, -1);
39         }
40         for(int i = 1; i <= n; i++)
41           if(i == n)
42             cout<<query(i)<<endl;
43           else cout<<query(i)<<" ";
44     }
45 
46     return 0;
47 }