var
n:longint;
a,b:array[1..2000000] of longint;
procedureqsort(l,r:longint);var
i,j,m,t:longint;
begin
i:=l;j:=r;
m:=b[(l+r)div2];
repeatwhile b[i]<m do inc(i);
while b[j]>m do dec(j);
if i<=j thenbegin
t:=a[i];a[i]:=a[j];a[j]:=t;
t:=b[i];b[i]:=b[j];b[j]:=t;
inc(i);dec(j);
end;
until i>j;
if i<r then qsort(i,r);
if l<j then qsort(l,j);
end;
var
i,ans,sum:longint;
begin
readln(n);
for i:=1to n do
readln(a[i],b[i]);
qsort(1,n);
ans:=b[1];
for i:=2to n doif a[i]>=ans thenbegin
inc(sum);
ans:=b[i];
end;
writeln(sum+1);
end.