#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <climits>
using namespace std;


int main() {
    int n;
    cin>>n;
    long long int a[n];
    for (int i = 0; i <n ; ++i) {
        cin>>a[i];
    }
    sort(a,a+n);
    long long int min=INT_MAX;
    for (int i = 0;  i <n-1 ; ++ i) {
        if(min>abs(a[i]-a[i+1])){
            min=abs(a[i]-a[i+1]);
        }
    }
    cout<<min<<endl;
    return 0;
}