#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 get_score(int N, vector<vector<int>> A, vector<vector<int>> C) {
    int res = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j <= i; j++) res = max(res, get_error(A[i][j], C[i][j]));
    }
    return res;
}

vector<int> get_answer(int N, vector<vector<int>> A) {
    int StartTime = clock();
    int BestError = (1 << 30);
    vector<int> BestAns;

    // Loops
    while (clock() - StartTime < 5 * CLOCKS_PER_SEC / 10) {
        vector<vector<int>> C(N, vector<int>(N, 0));
        C[0][0] = rand() % 100000000;
        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;
            }
        }
        
        // Calculate Score
        int CandError = get_score(N, A, C);
        if (BestError > CandError) {
            BestError = CandError;
            BestAns = C[N - 1];
        }
    }
    return BestAns;
}

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<int> Answer = get_answer(N, A);
    for (int i = 0; i < N; i++) {
        if (i >= 1) cout << " ";
        cout << Answer[i];
    }
    cout << endl;
    return 0;
}