#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;

int n,a[N],V;

map<int,int> S;

void dfs(int x,int pre){
    if (x > n){
        for (int i = 1;i <= n;i++)
            cout << a[i] << ' ';
        exit(0);
    }
    for (int v = pre;v <= V;v++){
        bool flg = 1;
        for (int i = 1;i < x;i++){
            if (!S[a[i] + v]){
                flg = 0;
                break;
            }
        }
        if (flg){
            a[x] = v;
            for (int i = 1;i < x;i++){
                S[a[i] + v]--;
            }
            dfs(x + 1,v);
            for (int i = 1;i < x;i++){
                S[a[i] + v]++;
            }
        }
    }
}

int main(){
    cin >> n;
    for (int i = 1;i <= n * (n + 1) / 2;i++){
        int x; cin >> x;
        V = max(V,x);
        S[x]++;
    }
    dfs(1,0);
}