#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
using namespace std;
int main(){
    vector<long long> vc;
    long long N,x,m=10000000;
    bool flag=0;
    cin >> N;
    while(N--){
        cin >> x;
        vc.push_back(x);
    }
    sort(vc.begin(),vc.end());
    for(long long i=1;i<vc.size();i++){
        if((vc[i]-vc[i-1])){
            flag=1;
            m = min(m,(vc[i]-vc[i-1]));
        }
    }
    if(flag)    cout << m;
    else    cout << '0';
    return 0;
}