#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
#define esper(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<int(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<x<<'\n',static_cast<void>(0)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout<<fixed<<setprecision(16);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
template<typename I,typename S,S (*op)(S,S),S (*e)(),typename F,S (*mapping)(F,S,I,I),F (*composition)(F,F),F (*id)()>
struct DynamicLazySegmentTree{
private:
  struct node{
    I l,r;
    node *left,*right;
    S val;
    F lazy;
    node(I l,I r,S val):l(l),r(r),val(val),lazy(id()),left(nullptr),right(nullptr){}
    void propagate(F f){
      val=mapping(f,val,l,r);
      lazy=composition(f,lazy);
    }
    void push(){
      I mid=(l+r)/2;
      if(!left)left=new node(l,mid,e());
      if(!right)right=new node(mid,r,e());
      left->propagate(lazy);
      right->propagate(lazy);
      lazy=id();
    }
    void update(){
      val=e();
      if(left)val=op(val,left->val);
      if(right)val=op(val,right->val);
    }
  };
  node *root;
  void set(node *v,I k,S x){
    if(v->r-v->l==1){
      v->val=x;
      return;
    }
    v->push();
    I mid=(v->l+v->r)/2;
    if(k<mid){
      if(!v->left)v->left=new node(v->l,mid,e());
      set(v->left,k,x);
    }
    else{
      if(!v->right)v->right=new node(mid,v->r,e());
      set(v->right,k,x);
    }
    v->update();
  }
  S get(node *v,I k){
    if(!v)return e();
    if(v->r-v->l==1)return v->val;
    v->push();
    I mid=(v->l+v->r)/2;
    if(k<mid)return get(v->left,k);
    else return get(v->right,k);
  }
  void apply(node *v,I lx,I rx,F f){
    if(v->r<=lx||rx<=v->l)return;
    if(lx<=v->l&&v->r<=rx){
      v->propagate(f);
      return;
    }
    v->push();
    I mid=(v->l+v->r)/2;
    if(!v->left)v->left=new node(v->l,mid,e());
    if(!v->right)v->right=new node(mid,v->r,e());
    apply(v->left,lx,rx,f);
    apply(v->right,lx,rx,f);
    v->update();
  }
  S prod(node *v,I lx,I rx){
    if(!v||v->r<=lx||rx<=v->l)return e();
    if(lx<=v->l&&v->r<=rx)return v->val;
    v->push();
    return op(prod(v->left,lx,rx),prod(v->right,lx,rx));
  }
public:
  DynamicLazySegmentTree():root(nullptr){}
  DynamicLazySegmentTree(I l,I r){
    root=new node(l,r,e());
  }
  void set(I k,S x){
    set(root,k,x);
  }
  S get(I k){
    return get(root,k);
  }
  void apply(I l,I r,F f){
    assert(l<=r);
    apply(root,l,r,f);
  }
  S prod(I l,I r){
    assert(l<=r);
    return prod(root,l,r);
  }
  S all_prod()const{
    return root->val;
  }
};
int op(int x,int y){return max(x,y);}
int e(){return 0;}
int mapping(int f,int x,int l,int r){return f+x;}
int composition(int f,int g){return f+g;}
int id(){return 0;}
void SOLVE(){
  int n;
  cin>>n;
  DynamicLazySegmentTree<int,int,op,e,int,mapping,composition,id>seg(0,1e9+1000);
  rep(i,n){
    int l,r;
    cin>>l>>r;
    seg.apply(l,r,1);
  }
  cout<<seg.all_prod()-1<<endl;
}