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

long long n, ans = 1e18;
vector <long long> a;

int main() {
    cin >> n;
    a.resize(n);
    for (int i = 0; i < n; i++){
        cin >> a[i];
    }
    
    sort(a.begin(), a.end());
    
    for (int i = 1; i < n; i++)
        ans = min(ans, a[i] - a[i - 1]);
    
    cout << ans;
    return 0;
}