#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

int main(){
	int n;
	cin >> n;
	vector<int> v(n);
	for(int i=0; i<n; i++) cin >> v[i];
	sort(v.begin(), v.end());
	v.erase( unique(v.begin(), v.end()), v.end());
	int ans = 1<<29;
	if(v.size() < 2) ans = 0;
	else{
		for(int i=1; i<v.size(); i++){
			ans = min(ans, v[i] - v[i-1]);
		}
	}

	cout << ans << endl;
	
	return 0;
}