#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstring>
#include <math.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<int,int> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
int n,ma,mi=2000000000,a;
int main(void){
    cin>>n>>a;
    ma=a;
    for(int i=1;i<n;i++){
        int b;
        cin>>b;
        mi=min(mi,b-a);
        a=b;
    }
    cout<<mi<<endl<<a-ma<<endl;
}