#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main(){


  int n;
  cin >> n;
  vector<int> v,w;
  int dis;
  dis = 1000001;
  //v:sort
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    v.push_back(a);
  }
  sort(v.begin(),v.end());
  //dis:距離の最小値
  for (int i = 0; i < n - 1; i++) {
    int t = v[i + 1] - v[i];
    if (t != 0 && dis > t) {
      dis = t;
    }
  }
  if(dis == 1000001){
    cout << 0 <<"\n";
  }else{
    cout << dis << "\n";
  }
  return 0;
}