#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

int main(void)
{
    int n;
    cin >> n;
    set<int> st;
    rep(i, n)
    {
        int x;
        cin >> x;
        st.insert(x);
    }
    if (st.size() == 1)
    {
        cout << 0 << endl;
        return 0;
    }
    st.insert(0);
    int ans = 1e9;
    auto itr = st.begin();
    while (next(itr) != st.end())
    {
        auto chmin = [](auto &a, auto b)
        { a = min(a, b); };
        chmin(ans, *next(itr) - *itr);
        itr++;
    }
    cout << ans << endl;
}