#include <bits/stdc++.h>
using namespace std;
int n,m,a[1000005],d[1000005],l,r,maxn;
int main(){
    cin >> n; 
    for (int i = 1;i <= n;i++){
        cin >> l >> r;
        d[l]++;
        d[r + 1]--;
    }
    for (int i = 1;i <= 1000005;i++){
        d[i] += d[i - 1];
        maxn = max(maxn,d[i]);
    }
    cout << maxn << "\n";
    return  0;
}