#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
#define rep(i,x) for(int i=0;i<(int)(x);++i)

int main(){
    int n, min = 0;
    cin >> n;
    vector<int> p(n);
    rep(i, n) cin >> p[i];
    sort(p.begin(), p.end(), greater<int>());
    p.erase(unique(p.begin(), p.end()), p.end());
    rep(i,p.size()-1) {
        if (!min || (p[i] - p[i+1]) < min) min = p[i] - p[i+1];
    }
    cout << min << endl;
    return 0;
}