#include <bits/stdc++.h>

using namespace std;

struct sortingAlgo{
   bool operator() (int i, int j){
       return (i < j);
   }  
}asc;

int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    // your code goes here
    
    //Sort in ascending order
    sort(a.begin(), a.end(), asc);
    
    //Find min diff
    int minDiff = abs(a[0] - a[1]);     
    for(int i = 0; i < a.size() - 1; i++){
        int diff = abs(a[i] - a[i+1]);
        if(minDiff > diff)
            minDiff = diff;
    }
    
    cout << minDiff << endl;
    
    return 0;
}