#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);

using namespace std;

namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const int inf = (int)1e9;const double INF = 1e12, EPS = 1e-9;

int calc2(int n, const vi &a, const vi &b){
	vector<pi> v;
	rep(i, n){
		v.emplace_back(a[i], 1);
		v.emplace_back(b[i], -1);
	}
	sort(all(v));
	int sum = 0, mx = 0;
	for(pi p : v){
		if(p.second < 0) --sum;
		else mx = max(mx, ++sum);
	}
	return mx;
}
template<class T>struct SegTreeSum{
	T *dat;
	int n;
	SegTreeSum(int size = 1000000){
		for(n = 1; n < size; n *= 2);
		dat = new T[2 * n - 1];
		init();
	}
	~SegTreeSum(){ delete [] dat; }
	
	void init(){
		rep(i, 2 * n - 1) dat[i] = 0;
	}
	void inc(int k){
		k += n - 1;
		dat[k]++;
		
		while(k > 0){
			k = (k - 1) / 2;
			dat[k] = dat[k * 2 + 1] + dat[k * 2 + 2];
		}
	}
	T query(int a, int b, int k, int l, int r){
		if(r <= a || b <= l) return 0;
		if(a <= l && r <= b) return dat[k];
		
		T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
		T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
		
		return vl + vr;
	}
	T query(int a, int b){ return query(a, b, 0, 0, n); }
};
int calc1(int n, const vi &a, const vi &b){
	const int MX = 100010;
	SegTreeSum<int> from(MX);
	SegTreeSum<int> to(MX);
	SegTreeSum<int> tmp(MX);
	vector<tuple<int, int, int>> v;
	
	rep(i, n){
		from.inc(a[i]);
		to.inc(b[i]);
		v.emplace_back(b[i], -a[i], i);
	}
	sort(all(v));
	int ans = 0;
	rep(i, v.size()){
		int a, b, id; tie(b, a, id) = v[i]; a *= -1;
		int cnt = 0, skip = 0;
		for(int j = i; j < v.size(); j++){
			if(get<0>(v[j]) != b || get<1>(v[j]) != -a) break;
			tmp.inc(a);
			skip++;
		}
		i += skip - 1;
		
		cnt += from.query(a, b); //dbg(a, b, id); dbg(cnt);
		cnt += to.query(a + 1, b + 1); //dbg(cnt);
		cnt -= tmp.query(a, b); //dbg(cnt);
		ans = max(ans, cnt);
	}
	return ans;
}

int main(){
	cin.tie(0); cin.sync_with_stdio(0);
	int n; cin >> n;
	vi a(n), b(n);
	rep(i, n) cin >> a[i] >> b[i];
	
	int ans2 = calc2(n, a, b);
	int ans1 = calc1(n, a, b);
	cout << ans1 << " " << ans2 << endl;
	return 0;
}

Measured memory_bytes: 12880