#define NDEBUG   
#include <cassert>
#ifdef NDEBUG
  #define EVAL
#else
  #include <iostream>
#endif
#include <fstream>
#include <utility>
#include <cmath>

using namespace std;

const int MAXN = 150000;
const int MAXM = 100000;  


int N;


int main() {
#ifdef EVAL
  ifstream fin("input.txt"); assert( fin );
  ofstream fout("output.txt");
#else
  istream &fin(cin);
  ostream &fout(cout);
#endif
 
  fin >> N ;
  int tab[N][5];
  for (int i = 0; i < N; i++)  {
      int a, b;
      fin >> a >> b;
      tab[i][0]=a;
      tab[i][1]=b;
      assert(0 <= a && a < MAXM);
      assert(0 <= b && b < MAXN);
    }
    for (int i=0;i<N;i++){
        tab[i][2] = tab[i][1] - tab[i][0];
    }
    for (int i=0;i<N;i++){
        int conta=0;
        for (int j=0;j<N;j++){
       
         if ((tab[i][0] > tab[j][0]) && (tab[i][0] < tab[j][1])||(tab[i][1] > tab[j][0]) && (tab[i][1] < tab[j][1])){
            conta=conta+1;
         }
 
        }

        tab[i][3] = conta;
    }
    int max=0;
    int res=0;
    for (int i=0;i<N;i++){
        if (tab[i][3]!=0){ 
            tab[i][4] = tab[i][2] + tab[i][3];
            }else{
            tab[i][4]=0;
        }
        if (max<tab[i][4]){
            max=tab[i][4];
        }
        
    }
    for (int i=0;i<N;i++){
        if (max==tab[i][4]){
            res=res+1;
            tab[i][0]=0;
            tab[i][1]=0;
            tab[i][2]=0;
            tab[i][3]=0;
            tab[i][4]=0;
        }
        
    }
    
    /*for (int i=0;i<N;i++){
        fout<<tab[i][0]<<' '<<tab[i][1]<<' '<<tab[i][2]<<' '<<tab[i][3]<<' '<<tab[i][4]<<'\n';
        
    }*/

    for (int i=0;i<N;i++){
        int conta=0;
        for (int j=0;j<N;j++){
       
         if ((tab[i][0] > tab[j][0]) && (tab[i][0] < tab[j][1])||(tab[i][1] > tab[j][0]) && (tab[i][1] < tab[j][1])){
            conta=conta+1;
         }
 
        }

        tab[i][3] = conta;
       
    }
      
        max=0;
        for (int i=0;i<N;i++){
         
        if (tab[i][3]!=0){ 
            tab[i][4] = tab[i][2] + tab[i][3];
            }else{
            tab[i][4]=0;
        }

        if (max<tab[i][4]){
            max=tab[i][4];
        }
        
    }
         for (int i=0;i<N;i++){
        if (max==tab[i][4]){
            res=res+1;//
            tab[i][0]=0;
            tab[i][1]=0;
            tab[i][2]=0;
            tab[i][3]=0;
            tab[i][4]=0;



        }
        
    }

       fout<<res;


  return 0;
}