#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
//#define N (1000000000+7)
#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}


int main(void){
	int n;
	cin>>n;
	set<int>s;
	for(int i=0;i<n;i++){
		int X;
		cin>>X;
		s.insert(X);
	}
	if(s.size()==1)cout<<0<<endl;
	else
	{
		vector<int>v;
		for(auto itr = s.begin();itr!=s.end();++itr){
			v.push_back((*itr));
		}
		int ans = inf;
		for(ll i=1;i<v.size();i++){
			ans = min(ans,v[i]-v[i-1]);
		}
		cout<<ans<<endl;
	}
	
	return 0;
}