#include <bits/stdc++.h>
#include<algorithm>

using namespace std;

int main(){
    int n, i, j;
    int a_i;
    int diff = INT_MAX;
    cin >> n;
    vector<int> a(n);
    for(a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    sort(a.begin(), a.end());
 
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   for (int i=0; i<n-1; i++)
      if (a[i+1] - a[i] < diff)
          diff = a[i+1] - a[i];
 
   // Return min diff
    cout<<diff;
    return 0;
}