#include<bits/stdc++.h>
using namespace std;
struct node{
int start;
int end;
}c[200];
bool cmp(node a,node b){
if(a.end==b.end){
return a.end<b.end;
}
else
return a.start<b.start;
}
int main()
{
int n,i;
while(scanf("%d",&n)!=EOF){
if(n==0)
break;
for(i=0;i<n;i++)
scanf("%d %d",&c[i].start,&c[i].end);
sort(c,c+n,cmp);
int sum=1;
for(i=1;i<n;i++){
if(c[i].start>=c[i-1].end){
sum++;
}
else{
c[i].end=min(c[i].end,c[i-1].end);
}
} printf("%d\n",sum);
}return 0;
}
09-05
487