#include <bits/stdc++.h>
using namespace std;

const int MAX = 100000000;

int get_error(int a, int b) {
    return min(abs(a - b), MAX - abs(a - b));
}

int main() {
    // Step 1. Input
    int N; cin >> N;
    vector<vector<int>> A(N, vector<int>(N, 0));
    for (int i = 0; i < N; i++) {
        for (int j = 0; j <= i; j++) cin >> A[i][j];
    }

    // Step 2. Solve
    vector<vector<int>> C(N, vector<int>(N, 0));
    C[0][0] = A[0][0];
    for (int i = 0; i < N - 1; i++) {
        pair<int, int> minv = make_pair((1 << 30), -1);
        for (int b = 0; b < MAX; b += 100000) {
            C[i + 1][0] = b;
            int maxv = get_error(C[i + 1][0], A[i + 1][0]);
            for (int j = 0; j <= i; j++) {
                C[i + 1][j + 1] = (C[i][j] - C[i + 1][j] + MAX) % MAX;
                maxv = max(maxv, get_error(C[i + 1][j + 1], A[i + 1][j + 1]));
            }
            minv = min(minv, make_pair(maxv, b));
        }
        C[i + 1][0] = minv.second;
        for (int j = 0; j <= i; j++) {
            C[i + 1][j + 1] = (C[i][j] - C[i + 1][j] + MAX) % MAX;
        }
    }

    // Step 3. Output
    for (int i = 0; i < N; i++) {
        if (i >= 1) cout << " ";
        cout << C[N - 1][i];
    }
    cout << endl;
    return 0;
}