#include<iostream>
#include<algorithm>
using namespace std;
int main(void)
{
	int i, n, t, min = 1000000, x[100010];
	cin >> n;
	for (i = 0; i < n; i++) {
		cin >> x[i];
	}
	sort(x, x + n);
	for (i = 0; i < n - 1; i++) {
		if (min > (x[i + 1] - x[i])&&x[i+1]-x[i]!=0)
			min = x[i + 1] - x[i];
	}
	if (x[0] == x[n - 1])min = 0;
	cout << min << endl;


	return 0;
}