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

#define ALL(x) (x).begin(),(x).end()

using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> x(n);
    for(int i = 0;i < n;i++){
        cin >> x[i];
    }
    sort(ALL(x));
    int ans = 0;
    for(int i = 1;i < n;i++){
        if(ans == 0 && x[i]-x[i-1] != 0)ans = x[i]-x[i-1];
        if(ans > x[i]-x[i-1] && x[i] != x[i-1])ans = x[i]-x[i-1];
    }
    cout << ans << endl;
    return 0;
}