#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>#include<cmath>usingnamespacestd;
constint N=1000001;
int a[N],now[N];
int main()
{
int n,x,i;
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d%d",&x,&a[i]);
int ans=1,tail=1;
now[0]=0; now[1]=a[1];
for (i=2;i<=n;i++)
{
if (a[i]>now[tail]) {ans++; tail++; now[tail]=a[i];}
if (a[i]<=now[tail])
{
while (a[i]<now[tail]) tail--;
if (a[i]>now[tail]) {ans++; tail++;now[tail]=a[i];}
}
}
printf("%d\n",ans);
return0;
}