#include<iostream>
#include<algorithm>

using namespace std;

#define NMAX 100000
#define INF 10000000

int main(){

	int N,X[NMAX];
	int ans=INF;

	cin>>N;
	for(int i=0;i<N;i++) cin>>X[i];

	sort(X,X+N);

	for(int i=0;i<N-1;i++){
		int dis=X[i+1]-X[i];
		if(dis<ans&&dis!=0) ans=dis;
	}

	if(ans==INF) cout<<"0"<<endl;
	else cout<<ans<<endl;

}