#include <bits/stdc++.h>
#define nmax 100010
#define max (long)(2e9+10)

using namespace std;

void qsort(long l, long r, long a[]){
    if(l >= r) return;
    long i =l, j = r, key = a[(l+r)/2];
    while(i < j){
        while(a[i]< key) i++;
        while(a[j]> key) j--;
        if(i <= j){
            long t = a[i]; a[i]= a[j]; a[j] =t;
            i++; j--;
        }
    }
    qsort(l, j, a);
    qsort(i, r, a);
}

int main(){
    long n, a[nmax];
    cin >> n;
    for(long i = 1; i<= n; i++) cin >> a[i];
    qsort(1, n, a);
    // your code goes here
    long min = max;
    for(long i = 1; i< n; i++){
        long t = abs(a[i+1]-a[i]);
        if(t < min) min = t;
    }
    cout << min;
    return 0;
}