#include <cstdio>
#include <algorithm>
using namespace std;
int n, m, tot;
long long a[100010], sum[310][310], all[310], totalsum;
pair<int, int> id[100010];
int main() {
    scanf("%d", &n);
    m = n * (n - 1) / 2;
    for (int i = 1; i <= m; i++) {
        scanf("%lld", &a[i]);
    }
    if (n == 1) {
        printf("0\n");
        return 0;
    }
    if (n == 2) {
        printf("0 %lld\n", a[1]);
        return 0;
    }
    sort(a + 1, a + m + 1);
    for (int i = 2; i <= 2 * n; i++) {
        for (int j = 1; j < i; j++) {
            int k = i - j;
            if (j <= n && k <= n && j < k) {
                id[++tot] = {j, k};
            }
        }
    }
    for (int i = 1; i <= m; i++) {
        sum[id[i].first][id[i].second] = a[i];
    }
    // for (int i = 1; i <= n; i++) {
    //     for (int j = i + 1; j <= n; j++) {
    //         printf("a[%d] + a[%d] = %lld\n", i, j, sum[i][j]);
    //     }
    // }
    totalsum = sum[1][n];
    for (int i = 1; i < n; i++) {
        totalsum += sum[i][i + 1];
    }
    totalsum /= 2;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (j < i) {
                all[i] += sum[j][i];
            } else {
                all[i] += sum[i][j];
            }
        }
        all[i] -= totalsum;
        all[i] /= n - 2;
        printf("%lld ", all[i]);
    }
    printf("\n");
    return 0;
}