#include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using tii=tuple<int,int,int>;
using qii=tuple<int,int,int,int>;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
constexpr int INF=1e9;
constexpr ll INF_ll=1e18;
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define replr(i,l,r) for (int i=(int)(l);i<(int)(r);i++)
#define all(v) v.begin(),v.end()
#define len(v) ((int)v.size())
template<class T> inline bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T &a,T b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}

namespace Timer{
    auto program_start=chrono::system_clock::now();
    auto start=program_start;
    void snap(){
        start=chrono::system_clock::now();
    }
    int get_ms(){
        auto now=chrono::system_clock::now();
        int ms=chrono::duration_cast<chrono::milliseconds>(now-start).count();
        return ms;
    }
    int get_ms_all_program(){
        auto now=chrono::system_clock::now();
        int ms=chrono::duration_cast<chrono::milliseconds>(now-program_start).count();
        return ms;
    }
}

mt19937 mt;
uint32_t rand_int(uint32_t r){  //[0,r)
    assert(r!=0);
    return ((uint64_t)mt()*r)>>32;
}
int rand_int(int l,int r){  //[l,r)
    assert(l<r);
    return l+rand_int(r-l);
}
constexpr double one_div_mt_max=1.0/(double)mt19937::max();
double rand_double(){  //[0.0,1.0]
    return mt()*one_div_mt_max;
}

constexpr int N=50,mod=100000000;
vector<vector<int>> A;

#include <atcoder/modint>
using mint=atcoder::static_modint<mod>;

vector<vector<vector<mint>>> C;

namespace Solver{

    void solve(){

        int min_score=INF;
        vector<vector<mint>> min_score_ans;

        while(Timer::get_ms()<1900){

            vector<vector<mint>> ans(N,vector<mint>(N,0));

            ans[0][0]=rand()%mod;

            int now_score=0;

            replr(i,1,N){
                vector<mint> v(i+1,0);
                replr(j,1,i+1) v[j]=ans[i-1][j-1]-v[j-1];

                vector<int> worst(i+1,0);
                rep(j,i+1){
                    mint opp=A[i][j]+mod/2;
                    if(j%2==0) worst[j]=(opp-v[j]).val();
                    if(j%2==1) worst[j]=(v[j]-opp).val();
                }
                sort(all(worst));
                pii best={-1,-1};
                rep(j,i+1){
                    int x=worst[j],y=(j+1<i+1)?worst[j+1]:worst[0]+mod;
                    int mid=(x+y)/2;
                    int gap=y-x;
                    chmax(best,{gap,mid});
                }
                ans[i][0]=best.second;
                replr(j,1,i+1) ans[i][j]=ans[i-1][j-1]-ans[i][j-1];

                rep(j,i+1){
                    int diff=abs(A[i][j]-(int)ans[i][j].val());
                    chmax(now_score,min(diff,mod-diff));
                }
            }

            if(chmin(min_score,now_score)){
                min_score_ans=ans;
            }
        }

        rep(i,N){
            cout << min_score_ans[N-1][i].val() << ' ';
        }
        cout << '\n';


        cerr << mod/2-min_score << ' ' << Timer::get_ms() << '\n';
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    Timer::snap();
    int _;
    cin >> _;
    A.resize(N);
    rep(i,N){
        A[i].resize(i+1);
        rep(j,i+1){
            cin >> A[i][j];
        }
    }

    C.assign(N,vector<vector<mint>>(N,vector<mint>(N,0)));

    rep(i,N) C[N-1][i][i]=1;

    for(int i=N-2;0<=i;i--){
        rep(j,i+1){
            rep(k,N){
                C[i][j][k]+=C[i+1][j][k];
                C[i][j][k]+=C[i+1][j+1][k];
            }
        }
    }

    Solver::solve();
    exit(0);
}