#include <fstream>
#include <algorithm>
using namespace std;
ifstream fi("granita.in");
ofstream fo("granita.out");
pair <int,int> a[16001],x;
int n,i,sol;

int main()
{
fi>>n;
for(i=1;i<=n;i++) fi>>  a[i].first>> a[i].second;
sort(a+1,a+n+1);
//for(i=1;i<=n;i++) fo<<a[i].first<<" "<<a[i].second<<'\n';

x.first=a[i].first;x.second=a[i].second;
for (i=2;i<=n;i++)
{ if(x.first < a[i].first and a[i].second < x.second ) sol++;
                  else {x.first=a[i].first;x.second=a[i].second;}
}

fo<<sol;

    return 0;
}