#include <bits/stdc++.h>

using namespace std;

const int INF = 1 << 30;

int main()
{
  int N;

  cin >> N;
  vector< int > X(N);
  for(int i = 0; i < N; i++) {
    cin >> X[i];
  }
  sort(begin(X), end(X));
  sort(begin(X), end(X));
  X.erase(unique(begin(X), end(X)), end(X));
  
  int ret = INF;
  for(int i = 1; i < X.size(); i++) {
    ret = min(ret, X[i] - X[i - 1]);
  }
  cout << ret % INF << endl;
}