#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;

#define MAX_N 16005
#define pb push_back

struct nod{long li, lf;} V[MAX_N];
int Rez, N;

void citire()
{
    scanf("%d",&N);

    for(int i = 1; i <= N; ++i)
        scanf("%ld %ld",&V[i].li, &V[i].lf);
}
struct cmp
{
    bool operator()(const nod A, const nod B) const
    {
        return (A.li < B.li) || ((A.li == B.li) && A.lf < B.lf);
    }
};
bool includ(nod A, nod B)
{
    return (A.li < B.li && A.lf > B.lf);
}

void solve()
{
    int ant = 1;
    sort(V + 1,V + N + 1, cmp());

    for(int i = 2; i <= N; ++i)
        if(includ(V[ant], V[i]))
            ++Rez;
        else
            ant = i;

    printf("%d\n",Rez);
}

int main()
{
    freopen("granita.in","rt",stdin);
    freopen("granita.out","wt",stdout);
    citire();
    solve();
}