#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <string>
#include <map>
#include <iterator>
#include <set>
#include <queue>

using namespace std;


int main() {


    int N;
    cin >> N;
    vector<int> xs;
    for (int i = 0; i < N; ++i) {
        int X;
        cin >> X;
        xs.push_back(X);
    }

    sort(xs.begin(), xs.end());

    int m = 1000000;

    int i = 0;
    bool found = false;
    for (; i < N; ++i) {
        for (int j = i + 1; j < N; ++j) {
            if (xs[i] == xs[j]) {
                continue;
            } else {
                m = min(m, xs[j] - xs[i]);
                i = j;
                found = true;
            }
        }
    }

    if (found) {
        cout << m << endl;
    } else {
        cout << 0 << endl;
    }


    return 0;

}