#include<bits/stdc++.h>
using namespace std;
int const N = 2e5 + 5, V = 1e5 + 5;
struct Line{
    int l, r;
    int id;
}line[N];
int n;
int bitr[N], bitl[N];
int lowbit(int x){
    return x & (-x);
}
int query(int x, int *bit){
    int sum = 0;
    while(x > 0){
        sum += bit[x];
        x -= lowbit(x);
    }
    return sum;
}
void modify(int x, int val, int *bit){
    while(x <= V){
        bit[x] += val;
        x += lowbit(x);
    }
}
vector<int> rId[N], lId[N];
int num[N];
int solve1(){
    for(int i = 1; i <= n; i++){
        rId[line[i].r].push_back(i);
        lId[line[i].l].push_back(i);
    }
    for(int i = 1; i <= V; i++){
        for(auto j : rId[i]){
            modify(line[j].r, 1, bitr);
            modify(line[j].l, 1, bitl);
        }
        for(auto j : rId[i]){
            num[line[j].id] += query(line[j].r, bitr) - query(line[j].l, bitr) - (query(line[j].r - 1, bitl) - query(line[j].l - 1, bitl));
        }
    }
    for(int i = 1; i <= V; i++){
        bitl[i] = 0;
    }
    for(int i = V; i >= 1; i--){
        for(auto j : lId[i]){
            modify(line[j].l, 1, bitl);
        }
        for(auto j :  lId[i]){
            num[line[j].id] += query(line[j].r - 1, bitl) - query(line[j].l - 1, bitl);
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; i++){
        ans = max(ans, num[i]);
    }
    return ans;
}
int solve2(){
    vector<pair<int, int> > p; // -1 is right 1 is left
    for(int i = 1; i <= n; i++){
        p.push_back({line[i].l, 1});
        p.push_back({line[i].r, -1});
    }
    sort(p.begin(), p.end());
    int ans = 0, cnt = 0;
    for(auto &i : p){
        cnt += i.second;
        ans = max(ans, cnt);
    }
    return ans;
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> line[i].l >> line[i].r;
        line[i].id = i;
    }
    cout << solve1() << ' ' << solve2() << '\n';
}