#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void) {
	int n;
	cin >> n;
	vector<int> x(n);
	for (int i = 0; i < n; ++i) cin >> x[i];
	sort(x.begin(), x.end());
	int INF = 100100100;
	int min_diff = INF;
	int prev = x[0];
	for (int i = 1; i < n; ++i) {
		if (x[i] == prev) continue;
		min_diff = min(min_diff, x[i] - prev);
		prev = x[i];
	}
	if (min_diff == INF) min_diff = 0;
	cout << min_diff << endl;
	return 0;
}