#include<bits/stdc++.h>
using namespace std;
struct Node{
	int x;
	int y;
}a[101];
bool cmp(Node c,Node d){	
	return c.y<d.y;
}
int n,endi,ans=1;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].x>>a[i].y;
	}
	sort(a+1,a+n+1,cmp);
//	for(int i=1;i<=n;i++){
//		cout<<a[i].x<<' '<<a[i].y<<endl;
//	}
	endi=a[1].y;
    for(int i=2;i<=n;i++){
		if(a[i].x>=endi){
			ans++;
			endi=a[i].y;
		}
	}
	cout<<ans;
	return 0;
}

/**************************************************************
	Problem: 1372
	User: linyifan
	Language: C++
	Result: Accepted
	Time:10 ms
	Memory:2076 kb
****************************************************************/