#include <bits/stdc++.h>   #pragma GCC optimize( Ofast )   #pragma GCC target( sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma )   #pragma GCC optimize( unroll-loops )   using namespace std;   long long MOD9 = 998244353;   long long MOD = 1000000007;   double eps = 1e-12;   void solve() {     int n;     cin >> n;     vector<pair<int, int> > v(n);     for (int i = 0; i < n; i++) cin >> v[i].first >> v[i].second;     sort((v).begin(), (v).end());     int p = 0, c = 0;     for (int i = 1; i < n; i++) {       if (v[i].second < v[p].second)         c++;       else         p = i;     }     cout << c <<   n ;   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     { solve(); }     return 0;   }   