#include <bits/stdc++.h>
#include <algorithm>

using namespace std;

#define min(a,b) ((a)<(b)?(a):(b))
#define MAX_INT 0x7FFFFFFF

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(a.begin(), a.end());
    
    int min_diff = MAX_INT;
    for( int i = 1; i < n; i++ ) {
        min_diff = min( min_diff, a[i] - a[i - 1] );
    }
    
    cout << min_diff;
    
    return 0;
}