/*
ID: jxia8101
TASK: milk2
LANG: C++  
*/
#include<bits/stdc++.h>
using namespace std;
//输入保证正确
//输出看仔细
//所有情况都测
//数组定义，保证正确
int a[1000500];
int main()
{
//	freopen("milk2.in", "r", stdin);	
//    freopen("milk2.out", "w", stdout);
	int n,x,y,first=INT_MAX,last=INT_MIN;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>x>>y;
		a[x]++;
		a[y]--;
		first=min(first,x);
		last=max(y,last);
	}
//	cout<< first<<" "<<last;
	int flag=0;
	int time1=0,time2=0,t=0,f=0;
	for(int i=first;i<=last;i++)
	{
		flag+=a[i];
		if(flag>0)
		{
			t++;
			time2=max(time2,f); 
			f=0;
		}
		else
		{
			f++;
			time1=max(time1,t);
			t=0;	
		}
//		cout<<time1<<" "<<time2<<endl;
//		cout<<flag<<endl;
	}
	cout<<time1<<" "<<time2;
//	fclose(stdin);							
//	fclose(stdout);
 	return 0;
}