#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> l(n), r(n);
    vector<int> v;
    for (int i = 0; i < n; i++) {
        cin >> l[i] >> r[i];
        v.push_back(l[i]);
        v.push_back(r[i]);
    }
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    vector<int> cnt(400010);
    for (int i = 0; i < n; i++) {
        int il = lower_bound(v.begin(), v.end(), l[i]) - v.begin();
        int ir = lower_bound(v.begin(), v.end(), r[i]) - v.begin();
        cnt[il]++;
        cnt[ir]--;
    }
    for (int i = 1; i < 400010; i++) {
        cnt[i] += cnt[i - 1];
    }
    int mx = *max_element(cnt.begin(), cnt.end());
    cout << mx - 1 << endl;
}