#include<bits/stdc++.h>
#pragma GCC optimize(2)
#define query(l, r) (max(st[__lg(r - l + 1)][l], st[__lg(r - l + 1)][r - (1 << (__lg(r - l + 1))) + 1]))
using namespace std;

int N, t;
vector<int> rem, check;
vector<int> tmp;

void dfs(int k){
	//cout << k << ";;\n";
	if (k == N){
		for (int i = 0; i < tmp.size(); i ++){
			for (int j = i + 1; j < tmp.size(); j ++){
				check.push_back(tmp[i] + tmp[j]);
			}
		}
		sort(check.begin(), check.end());
		if (check != rem) return;
		for (auto && i : tmp) printf("%d ", i);
		printf("\n");
		exit(0);
	}
	for (int i = 1; i <= 10; i ++){
		tmp.push_back(i);
		dfs(k + 1);
		tmp.pop_back();
	}
}

int main(){
#ifndef ONLINE_JUDGE
    freopen("../data.in", "r", stdin);
    freopen("../data.out", "w", stdout);
#endif

	scanf("%d", &N);
	for (int i = 0; 2 * i < N * (N - 1); i ++){
		scanf("%d", &t);
		rem.push_back(t);
	}
	sort(rem.begin(), rem.end());
	dfs(0);

    return 0;
}