Durian Company

/*
    Task    : _example
    Author  : Phumipat C. [MAGCARI]
    Language: C++
    Created : 13 October 2022 [21:20]
*/
#include<bits/stdc++.h>
using namespace std;
vector<pair<int ,int > > v;
int main(){
    int n,a,b;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d %d",&a,&b);
        v.push_back({a,1});
        v.push_back({b,-1});
    }
    sort(v.begin(),v.end());
    int now = 0,ans = 0;
    for(int i=0;i<v.size();i++){
        now+=v[i].second;
        if(i == v.size()-1 || v[i].first != v[i+1].first)
            ans = max(ans,now);
    }
    printf("%d\n",ans);
    return 0;
}