#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;

constexpr i64 INF = 1e18 + 1145;

void solve() {
    int n;
    cin >> n;
    vector<i64> a(n);
    for (int i = 0; i < n; i++)
        cin >> a[i];
    ranges::sort(a);
    vector<i64> ans(n + 1);
    function<void(int, int, i64, i64)> solve = [&](int l, int r, i64 vl,
                                                   i64 vr) {
        if (vl == vr) {
            for (int i = l; i <= r; i++)
                ans[i] = vl;
            return;
        }

        if (l > r) return;
        int c = 0;
        i64 vm = (vl + vr) / 2;
        for (int i = 0; i < n - 1; i++) {
            if (a[i + 1] - a[i] <= vm) c++, i++;
        }
        solve(l, c, vl, vm), solve(c + 1, r, vm + 1, vr);
    };
    solve(1, n / 2, 0, INF);
    for (int i = 1; i <= n / 2; i++)
        cout << ans[i] << " ";
    cout << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}