#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    // your code goes here
    sort(a.begin(), a.end());
    int min = a[1]-a[0];
    
    for (int i=1; i<n; i++)
        {
        if (min > (a[i]-a[i-1]))
            min = a[i]-a[i-1];
    }
    
    
    cout << min << endl;
    return 0;
}