#include <bits/stdc++.h>

using namespace std;

#define pii pair <int, int>
#define fi first
#define se second

void solve() {
    int n;
    cin >> n;
    vector <long long> a(n + 1);
    vector <int> p(n);
    iota(p.begin(), p.end(), 0);
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    sort(a.begin() + 1, a.end());
    sort(p.begin() + 1, p.end(), [&](int i, int j) {
        return a[i + 1] - a[i] < a[j + 1] - a[j];
    });
    vector <int> vis(n + 1);
    int cnt = 0, now = 0;
    for (int i = 1; i <= n / 2; ++i) {
        while (cnt < i * 2) {
            ++now;
            if (!vis[p[now]]) ++cnt;
            if (!vis[p[now] + 1]) ++cnt;
            vis[p[now]] = vis[p[now] + 1] = 1;
        }
        cout << a[p[now] + 1] - a[p[now]] << ' ';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int T = 1;
    // cin >> T;
    while (T--) solve();

    return 0;
}
// 1 2 3