#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>
#include <sstream>

using namespace std;


int main() {
	int i, j;
	long n;
	vector<long>x;

	cin >> n;

	bool flag = false;
	long num2 = 0;

	for (i = 0; i < n; i++) {
		long num;
		cin >> num;
		x.push_back(num);
	}

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

	for (i = 0; i < n-1; i++) {
		if (x[i + 1] != x[i]) {
			flag = true;
		}
	}

	if (flag == false) {
		cout << 0 << endl;
		return 0;
	}

	long minn = 999999999;

	if (n == 1) {
		cout << x[0] << endl;
		return 0;
	}

	for (i = 0; i < n-1; i++) {
		if (x[i + 1] == x[i]) {

		}
		else {
			minn = min(minn, x[i + 1] - x[i]);
		}
	}

	cout << minn << endl;



	getchar();
	getchar();
	return 0;
}