#include <bits/stdc++.h>

using namespace std;

int minDistance(const vector<int>& a) {
  set<int> sorted_a;
  const int n = a.size();
  for (int a_i = 0; a_i < n; a_i++) {
    if (sorted_a.find(a[a_i]) != sorted_a.end()) {
      return 0;
    }
    sorted_a.insert(a[a_i]);
  }
  auto it = sorted_a.begin();
  int min_distance = numeric_limits<int>::max();
  for (int a_i = 0; a_i < n - 1; a_i++) {
    min_distance = min(min_distance, abs((*it) - (*(++it))));
    if (min_distance == 1)
      break;
  }

  return min_distance;
}

int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int a_i = 0; a_i < n; a_i++) {
    cin >> a[a_i];
  }

  cout << minDistance(a) << endl;

  return 0;
}