/*  Erica N  */
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define int long long
#define ull unsigned long long
#define pii pair<int, int>
#define ps second
#define pf first
#define itn int
#define rd read()
int read(){
    int xx = 0, ff = 1;char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-')ff = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9')xx = xx * 10 + (ch - '0'), ch = getchar();
    return xx * ff;
}
// void write(int out) {
// 	if (out < 0)
// 		putchar('-'), out = -out;
// 	if (out > 9)
// 		write(out / 10);
// 	putchar(out % 10 + '0');
// }
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() { cerr << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cerr << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }


const int N = 3e5 + 5;
const int INF = 1e18;
const int M = 1e7;
const int MOD = 1e9 + 7;

int p[N];
int a[N];
int vis[N];
int n;
int m;
bool check(){
	for(int i=1;i<=m;i++){
        vis[a[i]]=0;
    }
    for(int i=1;i<=m;i++){
        vis[a[i]]++;
    }
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            if(!vis[p[i]+p[j]])return 0;
            vis[p[i]+p[j]]--;
        }
    }
    return 1;
}

void dfs(int x){
    if(x>n){
        if(check()){
            sort(p+1,p+n+1);
            for(int i=1;i<=n;i++){
                cout<<p[i]<<' ';
            }
            exit(0);
        }

        return ;
    }

    for(int i=0;i<=10;i++){
        p[x]=i;
        dfs(x+1);
    }
}

signed main() {
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);
     n=rd;
    m=n*(n-1)/2;
    for(int i=1;i<=n*(n-1)/2;i++){
        a[i]=rd;
    }

    sort(a+1,a+m+1);

    dfs(1);

    

}