#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

vector <pair <int, int > > intervale;


bool cmp (pair <int, int> a, pair <int, int> b) {
	if (a.first == b.first) return a.second > b.second;
	
	else return a.first < b.first;

}

int main () {

	freopen("granita.in", "r", stdin);
	freopen("granita.out", "w", stdout);

	int n;
	
	scanf("%d", &n);

	for ( int i = 0 ; i <n; i++){
		int x, y;
		scanf("%d%d", &x, &y);
		pair< int, int> interval = make_pair(x, y);
		intervale.push_back(interval);
	}
	
	sort(intervale.begin(), intervale.end(), cmp );
	
	int contor = 0;
	int capat_drept = intervale[0].second;
	
	for ( int i = 1; i<n; i++){
		if (intervale[i].second < capat_drept){
			contor ++;
		}
		else{
			capat_drept = intervale[i].second;
		}
	
	}
	
		printf("%d", contor);
		

	
	


return 0;
}