//经典贪心
#include<iostream>
using namespace std;const int MAXN = 105;
typedef struct
{
int s, e;
}T;
T ti[MAXN];
int cmp(const void *_p, const void*_q)
{
T *p = (T *)_p;
T *q = (T *)_q;
return (p->e - q->e);
}
int n;
int main(void)
{
while(cin>>n && n)
{
int cur;
int ans = 1;
for(int i = 0; i < n; i++)
{
cin>>ti[i].s>>ti[i].e;
}
qsort(ti, n, sizeof(ti[0]), cmp);
cur = ti[0].e;
for(int i = 1; i < n; i++)
{
if(ti[i].s >= cur)
{
ans++;
cur = ti[i].e;
}
}
cout<<ans<<endl;
}
return 0;
}