#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>

using namespace std;
int INF = 10000000;
int main() {
    int n;
    vector<int> x;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int a;
        cin >> a;
        x.push_back(a);
    }
    sort(x.begin(), x.end());
    int md = INF;
    for (int i = 1; i < n; ++i) {
        int d = x[i]-x[i-1];
        if (d == 0) continue;
        md = min(md,d);
    }
    if (md == INF) {
        cout << 0 << endl;
        return 0;
    }
    cout << md << endl;
    return 0;
}