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

int main(){
   int ans = 10000000,n;
   cin >> n;
   if(n == 1){
      cout << 0 << endl;
      return 0;
   }
   int x[n];
   for(int i = 0;i < n;i++) cin >> x[i];
   stable_sort(x,x + n);
   for(int i = 0;i < n - 1;i++) if(x[i] != x[i + 1]) ans = min(ans,x[i + 1] - x[i]);
   cout << ans << endl;
}