#include <bits/stdc++.h>
using namespace std;
using namespace std;
const int N = 1e5 + 100;
int n, m, cnt;
int a[N], ans[N];
int32_t main(){
    cin >> n;
    cnt = n * (n - 1) / 2;
    for(int i = 1;i <= cnt;i++) cin >> a[i];
    sort(a + 1, a + cnt + 1);
    ans[1] = (a[1] + a[2] + a[3]) / 2 - a[3];
    ans[2] = a[1] - ans[1];
    ans[3] = a[2] - ans[1];
    multiset<int> s;
    for(int i = 4;i <= cnt;i++) s.insert(a[i]);
    for(int i = 4;i <= n;i++){
        int val = *s.begin();
        ans[i] = val - ans[1];
        s.erase(s.find(val));
        for(int j = 2;j < i;j++) s.erase(s.find(ans[i] + ans[j]));
    }
    for(int i = 1;i <= n;i++) cout << ans[i] << " ";
	return 0;
}