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


int main(){
    int len, best = INT_MAX;
    cin >> len;
    vector<int> nums(len);
    for(int i = 0; i < len; ++i)
        cin >> nums[i];
    
    sort(nums.begin(), nums.end());
    
    for(int i = 1, test; i < len; ++i){
        test = nums[i] - nums[i-1];
        best = best > test ? test : best;
    }
    cout << best << endl;
    
    return 0;
}