#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))

// #define DEBUG

#ifdef DEBUG
#define dump(...) fprintf(stderr, __VA_ARGS__)
#else
#define dump(...)
#endif

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;

const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll inf =1LL << 62;
const ll mod=1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};


ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b,const ll &mod) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b,const ll &mod) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b,const ll &mod) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b,const ll &mod) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}

random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1,6);
uniform_real_distribution<double> score(0.0,10.0);

struct Segment_tree {
    using T = ll;

    int n;
    vector<T> data;
    const T out = 0;

    inline T vmerge(T l, T r) {return l + r;}

    Segment_tree(int n): n(n) {data.assign(2 * n, out);}

    void update(int p, T x) { // add value at position p
        for (data[p += n] += x; p > 1; p >>= 1) data[p >> 1] = vmerge(data[p], data[p ^ 1]);
    }

    T query(int l, int r) { // sum on interval [l, r)
        T resl = out, resr = out;
        for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
            if (l & 1) resl = vmerge(data[l++], resl);
            if (r & 1) resr = vmerge(resr, data[--r]);
        }
        return vmerge(resl, resr);
    }
};

inline int pow2fit(int x){
    int ret = 1;
    while(ret < x) ret *= 2;
    return ret;
}

const int M = (int)1e5 + 23;

int main(void){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n; cin >> n;
    using Elem = tuple<int, int, int>;
    set<Elem> s;
    Segment_tree segr(pow2fit(M)), segl(pow2fit(M));
    vi imo(M);
    rep(i, n){
        int l, r; cin >> l >> r;
        l--, r--;
        imo[l+1]++; imo[r+1]--;
        s .insert(Elem(r, l, i));
        segl.update(l, 1);
    }

    int resl = 0;
    rep(i, 1, M){
        int& cur = imo[i];
        cur = imo[i - 1] + cur;
        chmax(resl, cur);
    }

    int resu = 0;
    for(auto& e : s){
        int l, r, idx; tie(r, l, idx) = e;
        int cur = 0;
        segl.update(l, -1);
        segr.update(r - 1, 1);
        cur += segl.query(l, r);
        cur += segr.query(l, r);
        chmax(resu, cur);
    }

    cout << resu << " " << resl << endl;
    
    return 0;
}

Measured memory_bytes: 19772