#include<stdio.h>

#include<vector>

#include<algorithm>

using namespace std;

const int MAXN = ;

struct node

{

    int x, y;

    friend bool operator <(const node &t1, const node &t2)

    {

        return t1.x < t2.x;

    }

}date[MAXN];

int main()

{

    int N;

    scanf("%d", &N);

    for(int i=; i<N; i++)

        scanf("%d%d", &date[i].x, &date[i].y);

    sort(date, date+N);

    int ans=, x=-, t1=, t2=;

    for(int i=; i<N; i++)

    {

        if(x != date[i].x)

        {

            if(t1 < t2)

                t1 = t2;

            t2 = date[i].y;

            x = date[i].x;

        }

        if(t1 > date[i].y)

            ans++;

        t2 = max(t2, date[i].y);

    }

    printf("%d\n", ans);

    return ;

}