#include<iostream>
#include<algorithm>
using namespace std;
struct c{
int star;
int end;
}d[102];
bool comp(c m,c n){
return m.end<n.end;}
int main(){
int n;
while(scanf("%d",&n),n){
int i,j;
for(i=0;i<n;i++)
scanf("%d%d",&d[i].star,&d[i].end);
sort(d,d+n,comp);
i=1;j=1;
int x=d[0].end;
int y=d[i].star;
while(1){
if(i>=n) break;
if(y>=x){
j++;
x=d[i].end;
}
i++;
y=d[i].star;
}
printf("%d/n",j);
}
return 0;}