#include<bits/stdc++.h>
using namespace std;
void solve(){
	int n,t;
	cin>>n;
	t=(n*(n-1))/2;
	vector<int>a(t+1,0),b(n+1),ansArray;
	multiset<int>s,test;
	for(int i=1;i<=t;i++){
		cin>>a[i];
		s.insert(a[i]);
	}
	sort(a.begin()+1,a.end());
	for(int k=2;k<=t;k++){
		int mid=(a[2]+a[1]-a[k])/2;
		if(mid<=0)continue;
		test=s;
		b[1]=mid;
		int ans=1;
		multiset<int>::iterator it;
		for(int i=2;i<=n&&ans;i++){
			b[i]=*test.begin()-mid;
			test.erase(test.begin());
			for(int j=2;j<=i-1;j++){
				it=test.find(b[i]+b[j]);
				if(it!=test.end()){
					test.erase(it);
				}
				else{
					ans=0;
					break;
				}
			}
		}
		if(ans){
			ansArray=b;
			break;
		}
	}
	for(int i=1;i<=n;i++){
		cout<<ansArray[i]<<" ";
	}
}

int main()
{
	solve();
}