#include <bits/stdc++.h>

using namespace std;

// C++ program to find minimum difference between
// any pair in an unsorted array
#include <bits/stdc++.h>
using namespace std;
 
int findMinDifference(vector<int> vec)
{
   sort(vec.begin(), vec.end());
   int diff = INT_MAX;
   for (size_t i=0; i<vec.size()-1; i++){
             if (vec[i+1] - vec[i] < diff){
                diff = vec[i+1] - vec[i]; 
      }

   }

 
   return diff;
}
int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    cout<<findMinDifference(a);
    // your code goes here
    return 0;
}