#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int INF = 100100100;

int main()
{
	int n;
	cin >> n;

	vector<int> X(n);
	for (int i = 0; i < n; i++)
	{
		cin >> X[i];
	}
	sort(X.begin(), X.end());

	int ans = INF;
	for (int i = 0; i < n - 1; i++)
	{
		int a = X[i + 1], b = X[i];
		if (a != b)
		{
			ans = min(ans, a - b);
		}
	}
	cout << (ans != INF ? ans : 0) << endl;
}