#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("granita.in");
ofstream g("granita.out");
struct l
{
    int st,dr;
} a[16005];
int n,mst,mdr,sol;

bool comp(l x,l y)
{
    return (x.st<y.st);
}
void citire()
{
    f>>n;
    for(int i=1;i<=n;i++) f>>a[i].st>>a[i].dr;
}
void solve()
{
    sort(a+1,a+n+1,comp);
    mst=a[1].st;mdr=a[1].dr;
    for(int i=2;i<=n;i++)
    {
        if(a[i].dr<=mdr && a[i].st<=mdr) sol++;
        if(a[i].dr>mdr) mdr=a[i].dr;
    }
}
int main()
{
    citire();
    solve();
    g<<sol;
    return 0;
}