#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e3;
int a[N],b[N*N];
int n,m;
bool check(int id)
{
	int sum=b[1]+b[2]+b[id];
	if(sum&1) return 0;
	sum/=2;
	a[1]=sum-b[id],a[2]=sum-b[2];
	multiset<int> s;
	for(int i=2;i<=m;++i) s.insert(b[i]);
	for(int i=3;i<=n;++i)
	{
		int now=*s.begin()-a[1];a[i]=now;
		for(int j=1;j<i;++j)
		{
			if(!s.count(now+a[j])) return 0;
			s.erase(s.find(now+a[j]));
		}
	}
	return 1;
}


void solve()
{
	cin>>n;
	m=n*(n-1)/2;
	for(int i=1;i<=m;++i) cin>>b[i];
	sort(b+1,b+1+m);
	for(int i=3;i<=m;++i)
	{
		if(check(i))
		{
			for(int j=1;j<=n;++j) cout<<a[j]<<' ';
			return ;
		}
	}
}
signed main()
{
	solve();
	return 0;
}