#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<set>
#define ll long long
#define mp make_pair
using namespace std;
const int MN=305;
ll n,a[MN],sum[MN*MN];
multiset<ll> s;
multiset<ll>::iterator it;
void write(ll n){if(n<0){putchar('-');write(-n);return;}if(n>9)write(n/10);putchar(n%10+'0');}
ll read(){ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
bool check(ll x){
    a[1]=x;
    for(int i=2; i<=n; i++){
        a[i]=*s.begin()-a[1];
        for(int j=1; j<i; j++){
            it=s.find(a[j]+a[i]);
            if(it==s.end()) return false;
            s.erase(it);
        }
    }
    return true;
}
int main(){
    n=read();
    for(int i=1; i<=n*(n-1)/2; i++) sum[i]=read();
    sort(sum+1,sum+1+n*(n-1)/2);
    for(int i=0; i<=(sum[1]>>1); i++){
        s.clear();
        for(int j=1; j<=n*(n-1)/2; j++) s.insert(sum[j]);
        if(check(i)){
            for(int j=1; j<=n; j++) write(a[j]),putchar(' ');putchar('\n');
            return 0;
        }
    }
}