#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream cin ("granita.in");
ofstream cout("granita.out");

int n;
vector<pair<int, int> > V;
int a, b;
int sol = 0, x = -((1<<30));

inline bool cmp(pair<int, int> a, pair<int, int> b)
{
    return a.first < b.first ;
}
int main()
{
    cin >> n;
    for(int i = 1 ; i <= n ; ++ i)
    {
        cin >> a >> b;
        V.push_back(make_pair(a, b));
    }
    sort(V.begin(), V.end(), cmp);
    for(int i = 0 ; i < V.size() ; ++ i)
    {
        if(V[i].first >= x)
            x = V[i].second;
        else if(V[i].first < x && V[i].second < x)
            ++sol;
        else if(V[i].first <= x && V[i].second >= x)
            x = V[i].second;
    }
    cout << sol ;
    return 0;
}