#include<bits/stdc++.h>
using namespace std;
mt19937 mt(13770618);
int tot=0;
struct apple{
	int ls,rs,zz,sz,hp;
}e[300005];
int lz[300005];
void update(int x){
	e[x].sz=e[e[x].ls].sz+e[e[x].rs].sz+1;
}
void pushdown(int x){
	if(!x||!lz[x])return;
	if(e[x].ls){
		e[e[x].ls].zz+=lz[x];
		lz[e[x].ls]+=lz[x];
	}
	if(e[x].rs){
		e[e[x].rs].zz+=lz[x];
		lz[e[x].rs]+=lz[x];
	}
	lz[x]=0;
}
int rt=0;
pair<int,int>split(int ys,int k){
	if(!ys)return make_pair(0,0);
	pushdown(ys);
	if(e[ys].zz<=k){
		auto pi=split(e[ys].rs,k);
		e[ys].rs=pi.first;
		update(ys);
		return make_pair(ys,pi.second);
	}
	auto pi=split(e[ys].ls,k);
	e[ys].ls=pi.second;
	update(ys);
	return make_pair(pi.first,ys);
}
int merg(int x,int y){
	if(!x)return y;
	if(!y)return x;
	pushdown(x);pushdown(y);
	if(e[x].hp<e[y].hp){
		e[x].rs=merg(e[x].rs,y);
		update(x);
		return x;
	}
	e[y].ls=merg(x,e[y].ls);
	update(y);
	return y;
}
void inser(int x){
	auto pi=split(rt,x);
	++tot;
	e[tot].ls=e[tot].rs=0;
	e[tot].sz=1;
	e[tot].zz=x,e[tot].hp=mt()%10000000+1;
	rt=merg(merg(pi.first,tot),pi.second);
}
void delet(int x){
	auto pi=split(rt,x);
	auto ip=split(pi.first,x-1);
	int X=ip.first,Y=ip.second,Z=pi.second;
	pushdown(Y);
	rt=merg(X,merg(merg(e[Y].ls,e[Y].rs),Z));
}
int rk(int x){
	auto pi=split(rt,x-1);
	int ans=e[pi.first].sz;
	rt=merg(pi.first,pi.second);
	return ans;
}
int kr(int x){
	int wz=rt;
	while(1){
		pushdown(wz);
		int he=e[e[wz].ls].sz+1;
		if(x>he)x-=he,wz=e[wz].rs;
		else if(x==he)break;
		else wz=e[wz].ls;
	}
	return e[wz].zz;
}
int l[300005],r[300005];
int main(){
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;++i)scanf("%d%d",&l[i],&r[i]);
	for(int i=1;i<=n;++i){
		int L=l[i],R=r[i];
		int rr=rk(R)+1;
		if(rr<=e[rt].sz){
			delet(kr(rr));
		}
		auto pi=split(rt,L-1);
		auto ip=split(pi.second,R-1);
		++lz[ip.first];++e[ip.first].zz;
		rt=merg(pi.first,merg(ip.first,ip.second));
		inser(L);
	}
	printf("%d\n",e[rt].sz);
	return 0;
}