#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 300 + 5;
const int MAX_M = 300 * 299 / 2 + 5;

int N, M;
int a[MAX_M], b[MAX_N];

int main() {
    scanf("%d", &N);
    M = N * (N - 1) / 2;
    for (int i = 1; i <= M; i ++) {
        scanf("%d", &a[i]);
    }
    if (N == 1) {
        printf("0\n");
        return 0;
    } else if (N == 2) {
        printf("0 %d\n", a[1]);
        return 0;
    }
    sort(a + 1, a + 1 + M);
    for (int k = 3; k <= N; k ++) {
        if ((a[1] + a[2] + a[k]) % 2) continue;
        int ok = 1;
        b[1] = (a[1] + a[2] - a[k]) / 2;
        multiset<int> s;
        for (int i = 1; i <= M; i ++) {
            s.insert(a[i]);
        }
        for (int i = 2; i <= N; i ++) {
            int t = *s.begin();
            b[i] = t - b[1];
            if (b[i] < b[i - 1]) {
                ok = 0;
                break;
            }
            for (int j = 1; j < i; j ++) {
                auto it = s.find(b[j] + b[i]);
                if (it == s.end()) {
                    ok = 0;
                    break;
                }
                s.erase(it);
            }
        }
        if (ok) break;
    }
    for (int i = 1; i <= N; i ++) {
        printf("%d%c", b[i], i < N ? ' ' : '\n');
    }
    return 0;
}