/*

ID: wushuai2

PROG: milk2

LANG: C++

*/

//#pragma comment(linker, "/STACK:16777216") //for c++ Compiler

#include <stdio.h>

#include <iostream>

#include <fstream>

#include <cstring>

#include <cmath>

#include <stack>

#include <queue>

#include <vector>

#include <algorithm>

#define ll long long

#define Max(a,b) (((a) > (b)) ? (a) : (b))

#define Min(a,b) (((a) < (b)) ? (a) : (b))

#define Abs(x) (((x) > 0) ? (x) : (-(x)))

using namespace std;

const int INF = 0x3f3f3f3f;

struct sc{

    int s,e;

}a[];

bool cmp(struct sc a, struct sc b){

    if(a.s != b.s){

        return a.s < b.s;

    } else{

        return a.e > b.e;

    }

}

int main() {

    ofstream fout ("milk2.out");

    ifstream fin ("milk2.in");

    int i, j, k, t, n, m;

    int ans1 = , ans2 = ;

    fin >> n;

    for(i = ; i < n; ++i){

        fin >> a[i].s >> a[i].e;

    }

    sort(a, a + n, cmp);

    for(i = ; i < n - ; ++i){

        if(a[i].s == a[i + ].s){

            for(j = i + ; j < n - ; ++j){

                a[j] = a[j + ];

            }

            --n;

        }

    }

    for(i = ; i < n - ; ++i){

        if(a[i].e >= a[i + ].s){

            a[i].e = max(a[i].e, a[i + ].e);

            for(j = i + ; j < n - ; ++j){

                a[j] = a[j + ];

            }

            --n;

            --i;

        }

    }

    for(i = ; i < n; ++i){

        if(a[i].e - a[i].s > ans1){

            ans1 = a[i].e - a[i].s;

        }

        if(i < n -  && a[i + ].s - a[i].e > ans2){

            ans2 = a[i + ].s - a[i].e;

        }

    }

    fout << ans1 << ' ' << ans2 << endl;

    return ;

}