#include <iostream>
#include <vector>
#include <cstdint>
#include <algorithm>
#include <climits>

template <typename T = uint32_t>
void radixsort_unsigned(std::vector<T>& arr) {
    if (arr.empty()) {
        return;
    }
    std::vector<std::vector<T>> buckets(256);
    for (size_t i = 0; i < sizeof(T); ++i) {
        for (T num : arr) {
            uint8_t bucketIndex = (num >> (i * 8)) & 0xFF;
            buckets[bucketIndex].push_back(num);
        }
        size_t arrIndex = 0;
        for (auto& bucket : buckets) {
            for (T num : bucket) {
                arr[arrIndex++] = num;
            }
            bucket.clear();
        }
    }
}


int main() {
    int n;
    std::cin >> n;
    std::vector<uint32_t> x(n);
    for (int i = 0; i < n; i++) {
        std::cin >> x[i];
    }
    radixsort_unsigned(x);
    x.erase(std::unique(x.begin(), x.end()), x.end());
    n = int(x.size());
    if (n == 1) {
        std::cout << 0 << std::endl;
    } else {
        uint32_t ans = 1e9;
        for (int i = 1; i <= n; i++) {
            ans = std::min(ans, x[i] - x[i - 1]);
        }
        std::cout << ans << std::endl;
    }
}