#include <algorithm>
#include <deque>
using namespace std;
using ll = long long;

//135
int main() {
	int n, x[100000];
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
		scanf("%d", x + i);
	sort(x, x + n);

	int mind = 1e9;
	for (int i = 1; i < n; i++)
		if (x[i - 1] != x[i])
			mind = min(mind, abs(x[i] - x[i - 1]));
	if (mind != 1e9)
		printf("%d\n", mind);
	else
		printf("%d\n", 0);
}