#include <bits/stdc++.h>
using namespace std;
const int MaxN=2e5;
const int MaxA=1e9;
int N;
int a[MaxN+1];
int b[MaxN+1];
int add[MaxN+1]={};
int pos[MaxN+1]={};
int main() {
cin>>N;
for(int n=0;n<N;n++){
cin>>a[n]>>b[n];
add[a[n]]+=1;
add[b[n]]-=1;
}
int now=0;
int ans=pos[0];
for(int n=0;n<=N;n++){
now+=add[n];
pos[n]=now;
}
for(int n=0;n<=N;n++){
ans=max(ans,pos[n]);
}
cout<<ans;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNvbnN0IGludCBNYXhOPTJlNTsKY29uc3QgaW50IE1heEE9MWU5OwppbnQgTjsKaW50IGFbTWF4TisxXTsKaW50IGJbTWF4TisxXTsKaW50IGFkZFtNYXhOKzFdPXt9OwppbnQgcG9zW01heE4rMV09e307CgppbnQgbWFpbigpIHsKCWNpbj4+TjsKCWZvcihpbnQgbj0wO248TjtuKyspewoJCWNpbj4+YVtuXT4+YltuXTsKCQlhZGRbYVtuXV0rPTE7CgkJYWRkW2Jbbl1dLT0xOwoJfQoJaW50IG5vdz0wOwoJaW50IGFucz1wb3NbMF07Cglmb3IoaW50IG49MDtuPD1OO24rKyl7CgkJbm93Kz1hZGRbbl07CgkJcG9zW25dPW5vdzsKCX0KCWZvcihpbnQgbj0wO248PU47bisrKXsKCQlhbnM9bWF4KGFucyxwb3Nbbl0pOwoJfQoJY291dDw8YW5zOwoJcmV0dXJuIDA7Cn0=