#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    unsigned n;
    std::cin >> n;
    std::vector<long> v;
    v.reserve(n);
    for(unsigned i=0; i<n; ++i) {
        long x;
        std::cin >> x;
        v.push_back(x);
    }
    std::sort(v.begin(), v.end());
    long min_abs = v[1] - v[0];
    for(unsigned i=2; i<v.size(); ++i)
        if(v[i] - v[i-1] < min_abs)
            min_abs = v[i] - v[i-1];
    std::cout << min_abs << std::endl;
    return 0;
}