#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#define N 1000
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)

using namespace std;

typedef long long ll;

int main(void){
	std::vector<int> u,v;
	int n,a;
	cin>>n;
	re(i,n)cin>>a,v.push_back(a);
	sort(v.begin(),v.end());
	unique_copy(v.begin(),v.end(),back_inserter(u));
	if(u.size()==1){
		cout<<0<<endl;
		return 0;
	}
	int k=1000000;
	
	rep(i,1,u.size()) k=min(k,u[i]-u[i-1]);
	cout<<k<<endl;
	return 0;
}