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

int fomo(int arr[], int n)
{
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];
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
 
   // Return min diff
   return diff;
}
 

int main() {
    
    int a,b,c,d;
    cin>>a;
    int arr[a];
    for(b=0;b<a;b++)
        cin>>arr[b];
    
    cout<<fomo(arr,a);
      // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   // Find the min diff by comparing adjacent
   // pairs in sorted array
 
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}