#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <unordered_map>
#include <string.h>
#include <utility>

typedef long long ll;
const int INF = 1e8;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

vector<int> points;

int main() {

	int n=0;
	cin>>n;

	int tmp=0;
	for(int i=0; i<n; i++){
		cin>>tmp;
		points.push_back(tmp);
	}

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

	points.erase(unique(points.begin(),points.end()),points.end());


	if(points.size() ==1){
		cout<<0<<endl;
		return 0;
	}
	int ans =INF;
	for(int i=0; i<points.size()-1; i++){
		ans = min(ans,points[i+1]-points[i]);
	}

	cout<<ans<<endl;




return 0;

}