#include <cmath>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <iostream>
#include <algorithm>
#include <climits>

using namespace std;


using namespace std;

int main() {
	int n, i, min, diff, x;
	

	cin >> n;
	
	vector<int> vec(n);

	


	for (i = 0; i < n; i++) {
		cin >> x;
		vec[i] = x;
	}

 	sort(vec.begin(), vec.end());

	min = INT_MAX;
	for (i = 0; i < n - 1; i++)
	{
		diff = abs(vec[i] - vec[i + 1]);
		if (min > diff)
			min = diff;
	}

	cout << min;

	return 0;
}