#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("granita.in");
ofstream g("granita.out");
struct interv
{   int i1;
    int i2;

};
    interv x[50001];
    inline bool cmp(const interv A, const interv B)
    {
        if(A.i1>=B.i1)
            return A.i1<B.i1;
         return A.i2>B.i2;

    }
int main()
{int n,i,max,min,nr=0,j;
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>x[i].i1;
        f>>x[i].i2;
    }
    sort(x+1, x+n+1, cmp);

max=x[1].i1;
min=x[1].i2;
    for(i=2;i<=n;i++)
    {if((x[i].i1>=max)&&(x[i].i2<=min))
            nr++;

     else
        if(x[i].i2>min)
                min=x[i].i2;
    }
    g<<nr;
    return 0;
}