#include <iostream>
#include <sstream>
#include <math.h>
#include <stack>
#include <set>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <vector>
using namespace std;

#define INF (1 << 30)
#define INFLL (1LL << 60)

int x[100010];
int main() {
	int n;
	int ans = INF;
	cin >> n;
	for(int i = 0;i < n;i++){
		cin >> x[i];
	}
	sort(x,x + n);
	for(int i = 0;i < n-1;i++){
		if(x[i] == x[i+1]) continue;
		ans = min(ans,abs(x[i]-x[i+1]));
	}
	if(ans == INF) ans = 0;
	cout << ans << endl;
	return 0;
}