#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>

using namespace std;


int main() {
	int N;
	scanf("%d", &N);
	vector<int> a(N);
	vector<int> b(N - 1);
	for (int i = 0; i < N; i++)scanf("%d", &a[i]);
	for (int i = 0; i < N - 1; i++)b[i] = a[i + 1] - a[i];
	sort(b.begin(), b.end());
	int x = a[N - 1] - a[0];
	printf("%d\n", b[0]);
	printf("%d\n", x);
	return 0;
}