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


int main() {
    int size, i, j;
    int temp;
    vector<int> que;
    cin >> size;
    
    for(i = 0; i < size; i++)   {
        cin >> temp;
        que.push_back(temp);
    }
    sort (que.begin(), que.end());
    
    int min = abs(que[0] - que[1]);
    for(i = 0; i < size - 1; i++)   {
        temp = abs(que[i] - que[i + 1]);
        if(min > temp)  {
            min = temp;
        }
    }
    cout << min;
    
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}