#include<bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repi(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
typedef long long ll;
using namespace std;

int main(){
  int n;
  cin >> n;
  vector<int> x(n);
  rep(i,n){
    cin >> x[i];
  }
  sort(x.begin(),x.end());
  x.erase(unique(x.begin(),x.end()),x.end());
  
  if(x.size()<2){
    cout << 0 << endl;
    return 0;
  }
  int min = 1000000;
  n=x.size();
  rep(i,n-1){
    repi(j,i+1,n){
      int kyori = abs(x[i]-x[j]);
      if(kyori<min){
        min = kyori;
      }
    }
  }
  cout << min << endl;
  return 0;
}