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

int compare(const void *a, const void *b)
{
    if (*(int*)a > *(int*)b) return 1;
    else if (*(int*)a < *(int*)b) return -1;
    else return 0;
}

int main(){
    int n;
    cin >> n;
    int *a = new int[n];
    for (int a_i = 0; a_i < n; a_i++) {
        cin >> a[a_i];
    }
    // your code goes here
    qsort(a, n, sizeof(int), compare);

    long min_dist = LONG_MAX;
    long dist = 0;
    for (int i = 1; i < n; i++)
    {
        dist = abs(a[i] - a[i - 1]);
        if (min_dist > dist)
        {
            min_dist = dist;
        }
    }

    cout << min_dist << endl;
    return 0;
}