#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>
#include <map>
#include <queue>
#include <numeric>
#include <climits>
#include <iterator>
#include <bitset>
#include <functional>
using namespace std;
const constexpr int INF = 1e9;

long long N, M;
int y, m, d;
string S, T;
void solve(){
    int mind=1111110, maxd=0, temp=0;
    for(int i=0; i<N; ++i){
        int a; cin >> a;
        if(i==0) maxd=a;
        if(i==N-1) maxd = a - maxd;
        if(i!=0){
        mind = min(mind, abs(a-temp));
        }
        temp = a;
    }
    
    cout << mind <<endl;
    cout << maxd << endl;
    
}
int main() {
    cin >> N;
    solve();
	return 0;
}