#include<bits/stdc++.h>
using namespace std;
int n;
int a[100005];
int ans[1005];
bool check(int x){
	ans[1] = x;multiset<int>s;
	for(int i = 1;i<=n*(n-1)/2;i++)s.insert(a[i]);
	for(int i = 2;i<=n;i++){
		ans[i] = *s.begin()-ans[1];
		if(ans[i]<ans[i-1])return 0;
		for(int j = 1;j<i;j++){
			auto it = s.find(ans[j]+ans[i]);
			if(it==s.end())return 0;
			s.erase(it);
		}
	}return 1;
}
signed main(){
	cin >> n;
	for(int i = 1;i<=n*(n-1)/2;i++)cin >> a[i];
	sort(a+1,a+n*(n-1)/2+1);
	//a1+a2 = a[1]
	//a1+a3 = a[2]
	//a2+a3 = a[x]
	for(int i = 3;i<=n;i++){
		if(a[1]+a[2]-a[i]>=0 and (a[1]+a[2]-a[i])%2 == 0){
			if(check(a[1]+a[2]-a[i]>>1)){
				for(int j = 1;j<=n;j++)cout << ans[j] << " ";
				cout << endl;return 0;
			}
		}
	}
	return 0;
}