#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pl = pair<ll, ll>;

void solve() {
    ll n;
    cin >> n;
    vector<ll> a(n);
    for (auto &i: a)cin >> i;
    sort(a.begin(), a.end());
    vector<pl> b;
    for (ll i = 0; i + 1 < n; ++i) {
        b.push_back({a[i + 1] - a[i], i});
    }
    sort(b.begin(), b.end());
    set<pl> s;
    ll val = 0;
    ll i = 0;
    auto eval = [&](pl x) {
        return (x.second - x.first + 1 + 1) / 2;
    };
    for (ll need = 1; need <= n / 2; ++need) {
        while (val != need) {
            pl range = {b[i].second, b[i].second};
            {
                auto it = s.upper_bound({range.first, -1});
                if (it != s.begin() && it->second + 1 == b[i].second) {
                    --it;
                    range.first = min(range.first, it->first);
                    range.second = max(range.second, it->second);
                    val -= eval(*it);
                    s.erase(it);
                }
            }
            {
                auto it = s.upper_bound({range.first, -1});
                if (it != s.end() && it->first - 1 == b[i].second) {
                    range.first = min(range.first, it->first);
                    range.second = max(range.second, it->second);
                    val -= eval(*it);
                    s.erase(it);
                }
            }
            val += eval(range);
            s.insert(range);
            ++i;
        }
        cout << b[i - 1].first << " ";
    }
}

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