#include <bits/stdc++.h>
using namespace std;


template<typename type>
void vector_sort(vector<type>& v,function<int(type)> fn=[](int a){return a;}){
    auto a=[fn](type x,type y){return fn(x)>fn(y);};
    priority_queue<int,vector<int>,decltype(a)> q(a);
    for(int i=0;i<v.size();i++){
        q.push(v[i]);
    }
    for(int i=0;i<v.size();i++){
        v[i]=q.top();
        q.pop();
    }
}

template<typename type>
tuple<vector<type>,vector<int>> vector_runlength(vector<type> v){
    vector<type> element={};
    vector<int> number={};
    int consecutive=1;
    int n=v.size();
    for(int i=1;i<n;i++){
        if(v[i]==v[i-1]){
            consecutive++;
        }else{
            element.push_back(v[i-1]);
            number.push_back(consecutive);
            consecutive=1;
        }
    }
    element.push_back(v[n-1]);
    number.push_back(consecutive);
    return forward_as_tuple(element,number);
}

int main(){
    int N;
    cin>>N;
    vector<int> X(N);
    for(int i=0;i<N;i++){
        cin>>X[i];
    }
    vector_sort(X);
    tuple<vector<int>,vector<int>> A=vector_runlength(X);
    int m=10000000;
    for(int i=0;i<N-1;i++){
        m=min(m,get<0>(A)[i+1]-get<0>(A)[i]);
    }
    cout<<m<<endl;
}