#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pii pair<int, int>

void solve() {
    int n;
    cin >> n;
    vector<int> fa(n + 1), a(n + 1);
    vector<int> is(n + 1);
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        fa[i] = i;
        is[i] = true;
    }
    struct Node {
        int x, y, val;
        bool operator < (const Node a) const {
            return val < a.val;
        };
    };
    vector<Node> Edges(n);
    sort(a.begin() + 1, a.end());
    for(int i = 1; i < n; i++) {
        Edges[i] = {i, i + 1, a[i + 1] - a[i]};
    }
    sort(Edges.begin() + 1, Edges.end());
    function<int(int)> findf = [&](int x) {
        if(x == fa[x]) {
            return x;
        } return fa[x] = findf(fa[x]);
    };
    for(int i = 1; i < n; i++) {
        auto [x, y, val] = Edges[i];
        x = findf(x), y = findf(y);
        if(x != y) {
            if(is[x] && is[y]) {
                cout << val << ' ';
            }
            fa[x] = y;
            is[y] ^= 1;
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    // freopen("1.in", "r", stdin);
    int t = 1;
    // cin >> t;
    while(t--) {
        solve();
    }
}