1.2.1(extra)

/*
ID:18861501
LANG:C++
TASK:milk2
*/
/*------------------Header Files------------------*/
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <ctype.h>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#include <limits.h>
using namespace std;
/*------------------Definitions-------------------*/
#define LL long long
#define PI acos(-1.0)
#define INF 0x3F3F3F3F
/*---------------------Work-----------------------*/
struct link
{
	int b,e;
};
link s[5050];
bool cmp(link a,link t)
{
	if(a.b==t.b) return a.e<t.e;
	else return a.b<t.b;
}
void work()
{
	int N;
	scanf("%d",&N);
	for(int i=1;i<=N;i++)
		scanf("%d%d",&s[i].b,&s[i].e);
	sort(s+1,s+N+1,cmp);
	//一共就三种情况，分别讨论
	int l=s[1].b,r=s[1].e,MAX=r-l,MIN=0;
	for(int i=2;i<=N;i++)
	{
		if(s[i].e<=r) continue;
		else if(s[i].b<=r)
		{
			r=s[i].e;
			MAX=max(MAX,r-l);
		}
		else //这一步需要更新r,l了
		       //间隔的最大值只会出现在这种情况
		{
			MAX=max(MAX,s[i].e-s[i].b);
			MIN=max(MIN,s[i].b-r);
			l=s[i].b;
			r=s[i].e;
		}
	}
	printf("%d %d\n",MAX,MIN);
}
/*------------------Main Function------------------*/
int main()
{
	//freopen("test.txt","r",stdin);
	freopen("milk2.out","w",stdout);
	freopen("milk2.in","r",stdin);
	work();
	return 0;
}