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

int main()
{
    int n;
     cin >> n;
     int min_diff;
    vector<int> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    sort(a.begin(),a.end());
    min_diff=abs(a[1]-a[0]);
    for(int i = 2; i < n; i++){
       if (abs(a[i]-a[i-1])<min_diff){
        min_diff=abs(a[i]-a[i-1]);
       }
    }
    cout<<min_diff;
   return 0;
}