#include <cmath>
#include <cstdio>
#include <climits>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int n;
    cin >> n;
    
    vector<long long> a;
    vector<long long> b;
    bool inclzero = false;
    for (int i = 0; i < n; i++) {
        long long val;
        cin >> val;
        if (val > 0) {
            a.push_back(val);
        }
        if (val < 0) {
            b.push_back(val);
        }
        if (val == 0) {
            if (inclzero) {
                cout << 0 << endl;
                return 0;
            }
            inclzero = true;
        }
    }
    
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    long long minv = INT_MAX;
    for (int i = 1; i < a.size(); i++) {
        minv = min(minv, abs(a[i] - a[i-1]));
    }
    for (int i = 1; i < b.size(); i++) {
        minv = min(minv, abs(b[i] - b[i-1]));
    }
    if (a.size() != 0 && b.size() != 0) {
        minv = min(minv, abs(a[0] - b[0]));
    }
    if (inclzero) {
        if (a.size() != 0) {
            minv = min(minv, abs(a[0]));
        }
        if (b.size() != 0) {
            minv = min(minv, abs(b[0]));
        }
    }
    cout << minv << endl;
    return 0;
}