#include <bits/stdc++.h>

using namespace std;

int main() {
  int n;
  cin >> n;
  vector<int> x(n);
  for (int i = 0; i < n; ++i) cin >> x[i];

  const int INF = 1000000000;
  int ans = INF;
  sort(x.begin(), x.end());
  for (int i = 1; i < n; ++i) {
    if (x[i] != x[i - 1])  {
      ans = min(ans, x[i] - x[i - 1]);
    }
  }
  if (ans == INF) puts("0");
  else cout << ans << '\n';
  return 0;
}