#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 10;

typedef long long LL;

int n, fa[N], sze[N], ans[N]; LL a[N];

struct edge {
    int u, v; LL val;
    bool operator < (const edge &g) const {
        return val < g.val;
    }
} e[N];

int find(int u) {
    return fa[u] == u ? u : fa[u] = find(fa[u]);
}

int main() {
    cin.tie(0)->sync_with_stdio(false);
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i], fa[i] = i, sze[i] = 1;
    sort(a + 1, a + n + 1);
    for (int i = 2; i <= n; i++) e[i - 1] = (edge){i - 1, i, a[i] - a[i - 1]};
    sort(e + 1, e + n); e[n].val = -1;
    int res = 0, las = 0;
    for (int i = 1; i <= n; i++) {
        //cerr << i << " " << e[i].u << ' ' << e[i].v << " " << e[i].val << endl;
        if (e[i].val != e[i - 1].val) {
            for (int j = las + 1; j <= res; j++) ans[j] = e[i - 1].val;
            las = res;
        }
        int fu = find(e[i].u), fv = find(e[i].v);
        res -= (sze[fu] / 2) + (sze[fv] / 2);
        res += (sze[fu] + sze[fv]) / 2;
        //cout << fu << ' ' << fv << ' ' << res << "====\n";
        fa[fv] = fu, sze[fu] += sze[fv];
    }
    for (int i = 1; i <= res; i++) cout << ans[i] << ' ';

    return 0;
}