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

int main()
{
    int n;
    cin >> n;
    vector<int> x(n);
    for (int i = 0; i < n; i++)
        cin >> x[i];
    sort(x.begin(), x.end());
    int m = 1e9 + 7;
    for (int i = 1; i < n; i++)
        m = min(m, x[i] - x[i - 1]);
    cout << m << endl;
    cout << x[n - 1] - x[0] << endl;
}