//No.716 距離
#include<iostream>
using namespace std;
int main()
{
    int N;
    long long int min_d,max_d,p_i,n_i,f_d;
    min_d = 1000000;
    max_d = 0;
    cin>>N;
    cin>>p_i;
    f_d =p_i;
    for(int i=1;i<N;i++){
        cin>>n_i;
        if((n_i-p_i)<min_d)min_d=n_i-p_i;
        if((n_i-p_i)>max_d)max_d=n_i-p_i;
        p_i=n_i;
    }
    max_d=p_i-f_d;
    cout<<min_d<<endl;
    cout<<max_d<<endl;
    return 0;
}