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

// Returns minimum difference between any pair
int findMinDiff(int arr[], int n)
{
   // Sort array in non-decreasing order
   sort(arr, arr+n);

   // Initialize difference as infinite
   int diff = INT_MAX;

   // Find the min diff by comparing adjacent
   // pairs in sorted array
   for (int i=0; i<n-1; i++)
      if (arr[i+1] - arr[i] < diff)
          diff = arr[i+1] - arr[i];

   // Return min diff
   return diff;
}

// Driver code
int main()
{
    int t;
    cin >> t;
    int arr[t - 1];
    for(int i = 0; i < t; ++i){
        cin >> arr[i];
    }
   cout << findMinDiff(arr, t);
   return 0;
}