#include <iostream>
#include <vector>
#include <map>
#include<string>
#include<queue>
#include<math.h>
#define all(x) begin(x),end(x)
#define ll long long
#define P pair<int,int>
#define lP pait<ll,ll>
using namespace std;
int main() {
    int n,ans=10000000;
    cin>>n;
    vector<int> a(n);
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    sort(all(a));
    for(int i=0;i<n-1;i++){
        if(a[i]!=a[i+1]){
        ans=min(ans,abs(a[i]-a[i+1]));
        }
    }
    if(ans==10000000) cout<<0<<endl;
    else cout<<ans<<endl;
    return 0;
}