#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <map>
#include <deque>

using namespace std;

int main() {
    int n;
    cin >> n;
    int ans = 1000 * 1000 * 1001;
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }
    sort(v.begin(), v.end());
    for (int i = 1; i < n; i++) {
        if (v[i] - v[i - 1] < ans) {
            ans = v[i] - v[i - 1];
        }
    }
    cout << ans << endl;
}