#include <bits/stdc++.h>

using namespace std;

void quickSort(int arr[], int left, int right) {
      int i = left, j = right;
      int pivot = arr[(left + right) / 2];

      while (i <= j) {
            while (arr[i] < pivot)
                  i++;
            while (arr[j] > pivot)
                  j--;
            if (i <= j) {
                  swap(arr[i], arr[j]);
                  i++;
                  j--;
            }
      }

      if (left < j)
            quickSort(arr, left, j);
      if (i < right)
            quickSort(arr, i, right);
}

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];
    }
    
    quickSort(a, 0, n - 1);
    
    int min = a[1] - a[0];
    for(int i = 1; i < n - 1; i++) {
        if(a[i+1] - a[i] < min) {
            min = a[i+1] - a[i];
        }
    }
    cout << min;
    
    
    return 0;
}