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

using namespace std;

int main()
{
  int n;
  cin >> n;
  set<int> ss;

  for( int i = 0; i < n; i++ )
  {
	int v;
	cin >> v;
	ss.insert( v );
  }

  vector<int> vs;
  for( int v : ss )
  {
	vs.push_back( v );
  }

  sort( vs.begin(), vs.end() );

  int diff = 10000000;
  if ( vs.size() == 1 )
  {
	cout << 0 << endl;
  }
  else
  {
	for( int i = 0; i < vs.size() - 1; i++ )
	{
	  diff = min( diff, vs[ i + 1 ] - vs[ i ] );
	}
	cout << diff << endl;
  }
}