#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <utility>
#include <list>
#include <functional>
#include <queue>
#include <map>
#include <iterator>
#include <iomanip>
#include <complex>
using namespace std;

using ull = unsigned long long;
using ll = long long;


int main()
{
  int n;
  cin >> n;
  vector<int> N(n);

  for(auto&& x : N) cin >> x;

  sort(N.begin(),N.end());
  N.erase(unique(N.begin(),N.end()),N.end());

  int minimum = 1e8;
  for(int i = 0; i < N.size()-1; ++i)
  {
    minimum = min(minimum,N.at(i+1)-N.at(i));
  }

  if(N.size() != 1)
    cout << minimum << endl;
  else
    cout << 0 << endl;
}