#include<iostream>
#include<vector>
#include<algorithm>
#include<set>

using namespace std;

int main() {
	long long n, b,a=0,r=0,maxi=0;
	cin >> n;
	vector<long long>v;
	for (long long i = 0; i < n; i++) {
		cin >> b;
		v.push_back(b);
	}
	sort(v.begin(), v.end());
	maxi = v[v.size() - 1] - v[v.size() - 2];
	for (long long i = n-1; i >0; i--) {
		r = v[i] - v[i - 1];
		if (r < maxi) {
			maxi = r;
			if (r == 0) {
				cout << 0;
				return 0;
			}
		}
	}

	cout << maxi;
	return 0;

}