#include <iostream>
#include <algorithm>
using namespace std;
typedef pair<int, int> P;

const int MAX_N = 200000;
int N, r, R;
P mat[MAX_N * 2];

int main() {
    cin >> N;
    for (int i = 0; i < N; i++) {
        cin >> r >> R;
        mat[i * 2] = make_pair(r, 1);
        mat[i * 2 + 1] = make_pair(R, -1);
    }
    sort(mat, mat + 2 * N);
    int num = 0, rad = 0, ans = 0;
    for (int i = 0; i < 2 * N; i++) {
        if (rad != mat[i].first)
            ans = max(ans, num);
        num += mat[i].second;
        rad = mat[i].first;
    }
    cout << ans - 1 << endl;
    return 0;
}