#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) For(i, 0, n)
#define rFor(i, a, b) for(int i = a; i >= b; i--)
#define ALL(v) (v).begin(), (v).end()
#define rALL(v) (v).rbegin(), (v).rend()
using namespace std;

using lint = long long;
using ld = long double;

int INF = 2000000000;
lint LINF = 1000000000000000000;

int main() {
    int n;
    cin >> n;
    vector<int> x(n);
    rep(i, n) {
        cin >> x[i];
    }
    sort(ALL(x));
    x.erase(unique(ALL(x)), x.end());
    if (x.size() == 1) {
        cout << 0 << endl;
        return 0;
    }
    int ans = INF;
    rep(i, (int)x.size() - 1) {
        ans = min(ans, x[i + 1] - x[i]);
    }
    cout << ans << endl;
}