#include<bits/stdc++.h>
using namespace std;
struct Competition
{
int st,end;
}cpt[100005];
bool cmp_end(Competition tmp1,Competition tmp2)
{
return tmp1.end < tmp2.end;
}
int main()
{
int n,cnt=0;
scanf("%d",&n);
for(int i=1;i <= n;i++) scanf("%d%d",&cpt[i].st,&cpt[i].end);
sort(cpt+1,cpt+1+n,cmp_end);
int prev = 0;
for(int i=1;i <= n;i++)
{
if(cpt[i].st >= prev)
{
cnt++;
prev = cpt[i].end;
}
}
printf("%d",cnt);
return 0;
}