#include "bits/stdc++.h"
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const long long mod = 1e9 + 7;

ll gcd(ll a, ll b) {
	return b ? gcd(b, a % b) : a;
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

int main() {
	ll n;
	cin >> n;

	vector<ll> v(n);

	rep(i, n) {
		cin >> v[i];
	}

	ll Min = 1e9;
	ll Max = abs(v[0]-v[n-1]);

	rep(i, n - 1) {
		Min = min(Min, abs(v[i]-v[i+1]));
	}

	cout << Min << endl;
	cout << Max << endl;
}