#include <bits/stdc++.h>

using namespace std;

// #define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;
typedef multiset<int>::iterator iter;

const int N = 200010;
const int INF = 0x3f3f3f3f;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, a[N];
int ans[N];
multiset<int> mst;

signed main()
{
    read(n);
    for (int i = 1; i <= n * (n - 1) >> 1; i ++) read(a[i]);
    sort(a + 1, a + 1 + n * (n - 1) / 2);

    for (int num = 0; num <= a[1] / 2; num ++)  // a[i] = ans[1] + ans[2]
    {
        mst.clear();
        for (int i = 1; i <= n * (n - 1) / 2; i ++) mst.insert(a[i]);

        bool flag = true;
        ans[1] = num;
        for (int j = 2; j <= n && flag; j ++)
        {
            ans[j] = *mst.begin() - ans[1];
            for (int k = 1; k < j; k ++)
            {
                iter it = mst.find(ans[k] + ans[j]);
                if (it == mst.end())
                {
                    flag = false;
                    break;
                }
                else mst.erase(it);
            }
        }

        if (flag)
        {
            for (int i = 1; i <= n; i ++) cout << ans[i] << ' ';
            cout << '\n';
            return 0;
        }
    }

    return 0;
}