//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
using ll = long long;
const int INF32 = 2e9;
const ll INF64 = 4e18;
const int mod = 100000000;
const double fase1_LIMIT = 0.3, LIMIT = 1.85;

int idx_L = 0, idx_R = 0;
int calc_score(vector<vector<int>> a,vector<int> ans){
    int N = a.size();
    vector<vector<int>> ans_pyramid(N);
    rep(i,N)ans_pyramid[i].assign(i+1,0);
    rep(i,N)ans_pyramid[N-1][i]=ans[i];
    for(int i = N-1; i > 0; i--){
        for(int j = 0; j < i; j++){
            ans_pyramid[i-1][j]=(ans_pyramid[i][j]+ans_pyramid[i][j+1])%mod;
        }
    }
    int X = 0;
    for(int i = 0; i < N; i++){
        for(int j = 0; j < i; j++){
            int gosa = min(abs(a[i][j]-ans_pyramid[i][j]),mod-abs(a[i][j]-ans_pyramid[i][j]));
            if(gosa>X){
                X = gosa;
            }
        }
    }
    return mod/2-X;
}

int main() {
    srand((unsigned int)time(NULL));
    auto startTime = chrono::high_resolution_clock::now();
    int N;
    cin >> N;
    vector<vector<int>> a(N);
    rep(i,N)a[i].assign(i+1,0);
    rep(i,N){
        rep(j,i+1){
            cin >> a[i][j];
        }
    }
    vector<int> ans(N), bestans(N);
    int bestscore = 0;
    double elapsed = 0;
    while(elapsed<fase1_LIMIT){
        rep(i,N){
            ans[i]=rand()%mod;
        }
        int score = calc_score(a,ans);
        if(score>bestscore){
            bestans = ans;
            bestscore = score;
        }
        auto currentTime = chrono::high_resolution_clock::now();
        elapsed = chrono::duration_cast<chrono::milliseconds>(currentTime - startTime).count() / 1000.0;
    }
    while(elapsed<LIMIT){
        ans = bestans;
        int radidx = rand()%N;
        ans[radidx]+=rand()%6000000-3000000;
        if(ans[radidx]<0)ans[radidx]+=mod;
        if(ans[radidx]>=mod)ans[radidx]-=mod;
        int score = calc_score(a,ans);
        if(score>bestscore){
            bestans = ans;
            bestscore = score;
        }
        auto currentTime = chrono::high_resolution_clock::now();
        elapsed = chrono::duration_cast<chrono::milliseconds>(currentTime - startTime).count() / 1000.0;
    }
    rep(i,N){
        cout << bestans[i];
        if(i==N-1)cout << endl;
        else cout << " ";
    }
    cout << bestscore << endl;
    return 0;
}