#include <iostream>
#include <stdlib.h>
#include <algorithm>
using namespace std;

int main(){
	int n;
	cin>>n;
	int x[n];
	int absv = 1000000;
	int abst;
	int t = 0;

	for (int i = 0; i < n ; ++i)
	{
		cin>>x[i];
	}
	sort(x, x+n);

	for (int i = 0; i < n-1; ++i)
	{
		abst=abs(x[i]-x[i+1]);
		if(absv == 1){
			cout<<"1"<<endl;
			return 0;
		}
		if( abst <= absv ){
			if(abst != 0){
				absv = abst;
				t = 1;
			}
		}
	}
	if(t == 0){
		cout<<"0"<<endl;
		return 0;
	}
	cout<<absv<<endl;

}