#include <bits/stdc++.h>
using ll = long long;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++)
constexpr int inf = 2000'000'000;
constexpr ll linf = 4000000000000000000ll;
constexpr ll M7 = 1000000007ll;
constexpr ll M09 = 1000000009ll;
constexpr ll M9 = 998244353ll;
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;

// 同じ操作を2回行うと元に戻る

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector<ll> a(n + 1);
    reps(i, n) cin >> a[i];
    if (n == 1) {
        cout << 0 << endl;
        return 0;
    }

    vector<ll> ans(n + 1);
    bool all_same = true;
    ll diff_min = abs(a[2] - a[1]);
    multiset<ll> ms;
    reps(i, n) {
        auto lb = ms.lower_bound(a[i]);
        if (lb != ms.end()) {
            diff_min = min(diff_min, abs(*lb - a[i]));
        }
        if (lb != ms.begin()) {
            lb--;
            diff_min = min(diff_min, abs(*lb - a[i]));
        }
        ms.insert(a[i]);
        all_same &= a[i] == a[1];
        if (i == 1) {
            ans[i] = 0;
        } else {
            ans[i] = diff_min;
        }
    }
    reps(i, n) cout << ans[i] << endl;
}