#include <iostream>
#include <vector>
#include <algorithm>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)

using namespace std;

typedef long long int lli;

int main() {
    int N;
    cin >> N;
    vector<int> v(N);
    REP (i, 0, N) cin >> v[i];
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    if (v.size() == 1) cout << 0 << endl;
    else {
        int dis = 1e+9;
        REP (i, 0, v.size() - 1) dis = min(dis, v[i + 1] - v[i]);
        cout << dis << endl;
    }
    return 0;
}