#include<stdio.h>

 #include<string.h>

 #include<stdlib.h>

 #include<algorithm>

 #include<queue>

 //#include<iostream>

 using namespace std;

 int n;

 #define maxn 100011

 struct eve

 {

     int p,v;

     bool operator < (const eve &b) const

     {return p<b.p || (p==b.p && v<b.v);}

 }e[maxn];int le=;

 int x,y;

 int main()

 {

     scanf("%d",&n);

     for (int i=;i<=n;i++)

     {

         scanf("%d%d",&x,&y);

         e[++le].p=x;e[le].v=;

         e[++le].p=y+;e[le].v=-;

     }

     sort(e+,e++le);

     int now=,ans=;

     for (int i=;i<=le;i++)

     {

         now+=e[i].v;

         ans=max(ans,now);

     }

     printf("%d\n",ans);

     return ;

 }