#include<iostream>
#include<algorithm>
using namespace std;
int main(void)
{
	int v[100000] = { 0 };
	int n; cin >> n;
	for (int i = 0; i < n; i++){ cin >> v[i]; }
	sort(v, v + n);
	int value = 123456789;
	int m = value;
	for (int i = 0; i < n-1; i++){
		if (v[i]!=v[i+1]){
			m = min(m, abs(v[i + 1] - v[i]));
		}
	}
	cout << ((value == m) ? 0 : m) << endl;
	return 0;
}