#include <bits/stdc++.h>
#include <algorithm>
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 jump = INT_MAX;
    for(int i = 0; i < n -1; i++){
        int value = a[i] - a[i+1];
        if(value < 0)
            value*=-1;
        if(value < jump)
            jump = value;
    }
    cout << jump;
    return 0;
}