#include <bits/stdc++.h>
using namespace std;
 
// Returns minimum difference between any pair
int findMinDiff(long long 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 n;
    cin >> n;
  	long long int types[n];
    for(int types_i = 0; types_i < n; types_i++){
       cin >> types[types_i];
    }
	int s = sizeof(types)/sizeof(types[0]);
   cout <<findMinDiff(types, s)<<endl;
   return 0;
}