#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
const int MOD = int(1e9+7);

int A[111111];

int main(){
    int N; cin >> N;
    REP(i,N) cin >> A[i];
    sort(A,A+N);
    int minv = 1<<29;
    REP(i,N-1) if(A[i+1]!=A[i]) minv = min(minv, A[i+1]-A[i]);
    if(minv==1<<29)minv=0;
    cout << minv << endl;
    return 0;
}