#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define vi  vector<int>
#define vvi vector<vector<int>>
#define vl  vector<ll>
typedef pair<int, int> p;
#define rep(i, st, ed) for(int i = st; i < ed; ++i)
#ifndef ONLINE_JUDGE
#include "myprettyprint.hpp"
#else
#define dbg(...)
#endif
const int SZ=100010;
struct segtree{
	vl TREE;
	int N;

	void init(int n){
		N=n;
		TREE.resize(N*2);
	}
	void update(int p){
		p+=N;
		TREE[p]+=1;
		while(p>1){
			p>>=1;
			TREE[p]=TREE[p<<1]+TREE[p<<1|1];
		}
	}
	int16_t qry(int l,int r){
		l+=N, r+=N;
		int ret=0; 
		while(l<=r){
			if (l%2==1) ret+=TREE[l];
			if (r%2==0) ret+=TREE[r];
			l=(l+1)>>1;
			r=(r-1)>>1; 
		}
		return ret;
	}
}T1,T2;

int N;
vector<p> A;

void solve(){
  cin>>N;
  A.resize(N); T1.init(SZ); T2.init(SZ);
  rep(i,0,N) {
    int a,b;cin>>a>>b;  
    A[i]={a,b-1};
  }
  sort(A.begin(),A.end());

  priority_queue<int> HQ;
  int ans1=0,cnt=0;
  for(auto [a,b]:A){
    T1.update(a); T2.update(b);
    while(!HQ.empty() && HQ.top()>-a){
      cnt--;
      HQ.pop();
    }
    cnt++;
    HQ.push(-b);
    ans1=max(ans1,cnt);
  }
  
  int ans2=0;
  for(auto [a,b]:A){
    ans2=max(ans2,T1.qry(0,b)-T2.qry(0,a-1));
  }
  cout << ans2 << ' ' << ans1 << '\n';
}

int main(){
  cin.tie(nullptr)->sync_with_stdio(false);
  solve();
}