/*
ID: yanjunw1
PROG: milk2
LANG: C++
*/
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
struct milk{
int a,b;
};
milk f[5001];
bool comp(const milk &x,const milk &y)
{
return (x.a<y.a);
}
int main()
{
int n,i,l=0,s=0;
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d%d",&f[i].a,&f[i].b);
sort(1,1+n,comp);
for (i=1;i<=n;i++)
{
if (f[i].b<f[i+1].a)
{
if (f[i].b-f[i].a>l)
l=f[i].b-f[i].a;
if (f[i+1].a-f[i].b>s)
s=f[i+1].a-f[i].b;
}
else
{
f[i+1].b=max(f[i].b,f[i+1].b);
f[i+1].a=f[i].a;
}
}
printf("%d %d\n",l,s);
system("pause");
return 0;
}