#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long LL;

int main(){
    LL N;
    cin >> N;
    vector<LL> point(N);
    for(int i = 0; i < N; i++){
        cin >> point[i];
    }
    sort(point.begin(), point.end());
    LL ans = 1e+9;
    for(int i = 1; i < point.size(); i++){
        if(point[i] - point[i-1] > 0){
            ans = min(ans, point[i] - point[i-1]);
        }
    }
    if(ans == 1e+9) ans = 0;
    cout << ans << endl;
    return 0;
}