//hdu  1556
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <set>
#include <map>
using namespace std;
#define ll long long
#define  lowbit(x) x&(-x)
const int N=1e5+9;
ll  a[N],c[N];
ll  n,x,y;
void  update(ll x,ll  num){
    while(x<=n){
        c[x]+=num;
        x+=lowbit(x);
    }
}
ll  getsum(ll x){
    ll sum = 0;
    while(x>0){
        sum+=c[x];
        x-=lowbit(x);
    }
    return sum;
}
int  main()
{
    while(~scanf("%lld",&n),n){
        for(ll  i = 1 ;i <=n+9;i++){
            a[i]=0;
            c[i] =0;
        }
        for(ll i =0;i<n;i++){
            scanf("%lld%lld",&x,&y);
            update(x,1);
            update(y+1,-1);
        }
        for(ll  i =1;i<=n;i++){
            printf("%lld%c",getsum(i),i==n?‘\n‘:‘ ‘);
        }
    }
    return  0;
}