#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
inline int Calc(pii a) {
    return (a.second - a.first + 2) / 2;
}
int main() {
    int n;
    scanf("%d", &n);
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        scanf("%d", &a[i]);
    }
    sort(a.begin(), a.end());
    vector<pii> dif;
    for (int i = 0; i + 1 < n; ++i) {
        dif.push_back({a[i + 1] - a[i], i});
    }
    sort(dif.begin(), dif.end());
    map<int, int> mp;
    int cur_pair = 0;
    vector<int> ans(n / 2);
    for (auto [d, x] : dif) {
        int last_pair = cur_pair;
        auto [it, _] = mp.insert({x, x}); 
        ++cur_pair;
        if (it != mp.begin() && prev(it)->second == x - 1) {
            cur_pair -= Calc(*it);
            cur_pair -= Calc(*prev(it));
            --it;
            it->second = x;
            cur_pair += Calc(*it);
            mp.erase(next(it));
        }
        if (next(it) != mp.end() && next(it)->first == x + 1) {
            ++it;
            cur_pair -= Calc(*it);
            cur_pair -= Calc(*prev(it));
            --it;
            it->second = x;
            cur_pair += Calc(*it);
            mp.erase(next(it));
        }
        for (int i = last_pair; i < cur_pair; ++i) ans[i] = d;
    }
    for (auto x : ans) printf("%d ", x);
    puts("");
    return 0;
}