#include<iostream>
#include<algorithm>
using namespace std;
void f(int arrl[], int exit[], int n)
{
sort(arrl, arrl+n);
sort(exit, exit+n);
int cur = 1, ans = 1, time = arrl[0];
int i = 1, j = 0;
while (i < n && j < n)
{
if (arrl[i] <= exit[j])
{
cur++;
if (cur > ans)
{
ans = cur;
time = arrl[i];
}
i++;
}
else
{
cur--;
j++;
}
}
cout << ans;
}
const int N = 1e5+1;
int a[N],b[N];
int n;
int main() {
cin >> n;
for(int i = 0;i < n;i++)cin >> a[i] >> b[i];
f(a,b, n);
return 0;
}
I2luY2x1ZGU8aW9zdHJlYW0+IAojaW5jbHVkZTxhbGdvcml0aG0+IAp1c2luZyBuYW1lc3BhY2Ugc3RkOyAKIAp2b2lkIGYoaW50IGFycmxbXSwgaW50IGV4aXRbXSwgaW50IG4pIAp7IAoJc29ydChhcnJsLCBhcnJsK24pOyAKCXNvcnQoZXhpdCwgZXhpdCtuKTsgCiAKCWludCBjdXIgPSAxLCBhbnMgPSAxLCB0aW1lID0gYXJybFswXTsgCglpbnQgaSA9IDEsIGogPSAwOyAKCXdoaWxlIChpIDwgbiAmJiBqIDwgbikgCgl7IAoJCWlmIChhcnJsW2ldIDw9IGV4aXRbal0pIAoJCXsgCgkJCWN1cisrOyAKIAoJCQlpZiAoY3VyID4gYW5zKSAKCQkJeyAKCQkJCWFucyA9IGN1cjsgCgkJCQl0aW1lID0gYXJybFtpXTsgCgkJCX0gCgkJCWkrKzsKCQl9IAoJCWVsc2UgCgkJeyAKCQkJY3VyLS07IAoJCQlqKys7IAoJCX0gCgl9CSAKIApjb3V0IDw8IGFuczsgCn0gCiAKY29uc3QgaW50IE4gPSAxZTUrMTsKaW50IGFbTl0sYltOXTsKaW50IG47CiAKCmludCBtYWluKCkgewogICAgY2luID4+IG47Cglmb3IoaW50IGkgPSAwO2kgPCBuO2krKyljaW4gPj4gYVtpXSA+PiBiW2ldOwoJZihhLGIsIG4pOyAKCXJldHVybiAwOyAKfQ==