#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+1;
struct node
{
	int x,y;
};
int cmp(node a,node b)
{
	return a.y>=b.x;
}
node a[maxn];
int n;
int main()
{
	ios::sync_with_stdio(false);
	cin>>n;
	for(int i=1;i<=n;++i) cin>>a[i].x>>a[i].y;
	sort(a+1,a+n+1,cmp);
	int s=0;
	for(int i=2;i<=n;++i)
	{
		if(cmp(a[i-1],a[i])) ++s;
	}
	cout<<s<<endl;
	return 0;
}