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

using namespace std;

int main(){
    int n, t; cin >> n;
    vector<int> s;
    for (int i=0; i<n; i++){
        cin >> t;
        s.push_back(t);
    }
    sort(s.begin(), s.end());
    int minval = s[1]-s[0];
    int diff;
    for (int i=2; i<n; i++){
        diff = s[i]-s[i-1];
        if (diff<minval)    minval = diff;
    }
    cout << minval;
    return 0;
}