#include <bits/stdc++.h>
using namespace std;

int main()
{
	int n;
	cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(a.begin(), a.end());
	int mi = INT_MAX, ma = a.back() - a.front();
	for (int i = 1; i < n; i++) {
		mi = min(mi, a[i] - a[i - 1]);
	}
	cout << mi << endl;
	cout << ma << endl;
	return 0;
}