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

#define o cin

int main() {
    int oo;
    o>>oo;
    vector<int> _(oo);
    int O,oO=00;
    while (o>>O)
        _[oO++] = O;
    sort(_.begin(),_.end());
    for(oO=oo-1;oO>0;--oO)
        _[oO]-=_[oO-1];
    cout<<*min_element(1+_.begin(),_.end())<<endl;
    return 0;
}