#include<cstdio>#include<algorithm>#include<cstring>#define maxn 100050using namespace std;int b[maxn];int n;int lowbit(int x){    return x&(-x);}void ADD(int x, int c)    //向下查询{    for (int i=x; i>0; i-=i&(-i))     b[i] += c;}int SUM(int x)     //向上统计{    int s = 0;    for (int i=x; i<=n; i+=i&(-i))     s += b[i];    return s;}int main(){    while(scanf("%d",&n)&&n)    {        int x,y;        memset(b,0,sizeof b);        for(int i=0; i<n; i++)        {            scanf("%d%d",&x,&y);            ADD(y,1);            ADD(x-1,-1);        }        for(int i=1; i<n; i++)        {            printf("%d ",SUM(i));        }        printf("%d\n",SUM(n));    }    return 0;}