#include <fstream>
#include <algorithm>

using namespace std;

ifstream f("granita.in");
ofstream g("granita.out");

    struct sectiune
    {
        int minim,maxim;
    }v[500005];
    bool xyz(sectiune x,sectiune y)
    {
        if(x.minim!=y.minim)
        {
            x.minim<y.minim;
        }
        else
        {
            x.maxim<y.maxim;
        }
    }

int i,n,inutile,capat,inceput;

int main()
{

    f>>n;

    for(i=1;i<=n;i++)
    {
        f>>v[i].minim>>v[i].maxim;
    }

    sort(v+1, v+n+1, xyz);

    capat=v[1].maxim;
    inceput=v[1].minim;

    for(i=2;i<=n;i++)
    {
        if(v[i].maxim<=capat )
        {
            inutile++;
        }
        else if(v[i].minim>capat)
        {
            capat=v[i].maxim;
            inceput=v[i].minim;
        }
        else
        {
            capat=v[i].maxim;
        }
    }

    g<<inutile;

    return 0;
}