#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int n;
    cin >> n;
    int Min;
    vector<int> numbers(n);
    
    for(int i = 0; i < n; i++){
        int num;
        cin >> num;
        numbers[i] = num;
    }
    sort(numbers.begin(),numbers.end());
    Min = abs(numbers[0]-numbers[1]);
    for(int i = 1; i + 1 < n; i++)
        {
        int sub = abs(numbers[i]-numbers[i+1]);
        if(sub < Min) Min = sub;
    }
    cout << Min;   
    return 0;   
    return 0;
}