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

const int MAX = 100000000;
unsigned int seed = 869120;

unsigned int Rand() {
    seed ^= seed << 13;
    seed ^= seed >> 17;
    seed ^= seed << 5;
    return seed;
}

int score_function(int N, vector<vector<int>> A, vector<int> C) {
    vector<vector<int>> B(N, vector<int>(N, 0));
    for (int i = 0; i < N; i++) B[N - 1][i] = C[i];
    for (int i = N - 2; i >= 0; i--) {
        for (int j = 0; j <= i; j++) B[i][j] = (B[i + 1][j] + B[i + 1][j + 1]) % 100000000;
    }
    int max_error = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j <= i; j++) max_error = max(max_error, min(abs(A[i][j] - B[i][j]), 100000000 - abs(A[i][j] - B[i][j])));
    }
    return 50000000 - max_error;
}

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. Hill Climbing
    vector<int> C(N, 0);
    int StartTime = clock();
    int current_score = score_function(N, A, C);
    while (clock() - StartTime < 18 * CLOCKS_PER_SEC / 10) {
        int pos = Rand() % N;
        int new_val = Rand() % MAX;
        int moto = C[pos];
        C[pos] = new_val;
        int cand_score = score_function(N, A, C);
        if (current_score <= cand_score) {
            current_score = cand_score;
        }
        else {
            C[pos] = moto;
        }
    }

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