#include <bits/stdc++.h>   using namespace std;   void err(istream_iterator<string> it) {}   template <typename T, typename... Args>   void err(istream_iterator<string> it, T a, Args... args) {     cerr <<     << *it <<   =   << a;     err(++it, args...);   }   template <typename T, typename U>   inline void min_self(T& x, U y) {     if (y < x) x = y;   }   template <typename T, typename U>   inline void max_self(T& x, U y) {     if (x < y) x = y;   }   template <class T1, class T2>   ostream& operator<<(ostream& out, pair<T1, T2> pair) {     return out <<  (  << pair.first <<  ,   << pair.second <<  ) ;   }   template <class T>   ostream& operator<<(ostream& out, vector<T> vec) {     out <<  ( ;     for (auto& v : vec) out << v <<  ,  ;     return out <<  ) ;   }   template <class T>   ostream& operator<<(ostream& out, set<T> vec) {     out <<  ( ;     for (auto& v : vec) out << v <<  ,  ;     return out <<  ) ;   }   template <class L, class R>   ostream& operator<<(ostream& out, map<L, R> vec) {     out <<  ( ;     for (auto& v : vec) out <<  [  << v.first <<  ,   << v.second <<  ] ;     return out <<  ) ;   }   template <class A, class B>   istream& operator>>(istream& in, pair<A, B>& a) {     return in >> a.first >> a.second;   }   template <class A>   istream& operator>>(istream& in, vector<A>& a) {     for (A& i : a) in >> i;     return in;   }   long long XX[4] = {-1, 0, 1, 0};   long long YY[4] = {0, -1, 0, 1};   void solve() {     long long n, res = 0;     cin >> n;     vector<pair<long long, long long>> a(n);     for (long long i = 0; i <= n - 1; i++) cin >> a[i];     sort(a.begin(), a.end());     long long maxi = a[0].second;     for (long long i = 1; i <= n - 1; i++) {       if (a[i].second < maxi && a[i].first > a[i - 1].first) {         res++;       }       max_self(maxi, a[i].second);     }     cout << res <<   n ;     return;   }   int32_t main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     long long t = 1;     while (t--) {       solve();     }     return 0;   }   