#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#define INF 1000000000

using namespace std;
typedef long long ll;

const int MAXN = 100100;
vector<int> X;

int main(void) {
    int N;
    cin >> N;
    for (int i = 0; i < N; i++) {
        int x;
        cin >> x;
        X.push_back(x);
    }
    sort(X.begin(), X.end());
    X.erase(unique(X.begin(), X.end()), X.end());
    if (X.size() == 1) {
        cout << 0 << endl;
        return 0;
    }
    int mind = INF;
    for (int i = 0; i < X.size() - 1; i++) {
        mind = min(mind, X[i+1] - X[i]);
    }
    cout << mind << endl;
    return 0;
}