/* Author : Jordhy Fernando */
#include<bits/stdc++.h>
#define ll long long
#define For(i,j,n) for(int i = j; i < n; i++)
#define EPS 1e-12

using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;

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


int main() {
    int n, arr[100005], ans;
    cin >> n;
    ans = 2000000005;
    for(int i = 0; i < n; i++){
        cin >> arr[i];
    }
    sort(arr, arr + n);
    for(int i = 1; i < n; i++){
        ans = min(ans, abs(arr[i] - arr[i-1]));
    }
    cout << ans << endl;
    return 0;
}