#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;
    }
}

//https://ei1333.github.io/library/other/xor-shift.hpp.html

namespace Random{
    uint64_t x=88172645463325252;
    constexpr uint32_t mask=numeric_limits<uint32_t>::max();
    constexpr double k=1.0/(double)(numeric_limits<uint64_t>::max());
    inline uint64_t xorshift64(){
        x^=x<<7;
        x^=x>>9;
        return x;
    }
    inline uint32_t rand_int(uint32_t r){  //[0,r)
        assert(r!=0);
        return (xorshift64()&mask)*r>>32;
    }
    inline int rand_int(int l,int r){  //[l,r)
        assert(l<=r);
        return l+rand_int(r-l);
    }
    inline double rand_double(){  // [0.0,1.0]
        return xorshift64()*k;
    }
}
using Random::rand_int,Random::rand_double;

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{

    
    int min_score=INF;
    vector<vector<mint>> ans,best_ans;

    int cnt=0;

    bool dfs(int i,int border){

        cnt++;

        if((cnt&127)==127&&1900<=Timer::get_ms()){
            rep(j,N){
                cout << best_ans[N-1][j].val() << ' ';
            }
            cout << '\n';
            exit(0);
        }

        if(i==N){
            best_ans=ans;
            return true;
        }

        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));
        vector<pii> lr;
        rep(j,i+1){
            int x=worst[j],y=(j+1<i+1)?worst[j+1]:worst[0]+mod;
            if(2*border<=y-x) lr.emplace_back(x+border,y-border+1);
        }
        if(lr.empty()) return false;

        rep(t,45){

            int idx=rand_int(len(lr));
            int x=rand_int(lr[idx].first,lr[idx].second);
            ans[i][0]=x;
            replr(j,1,i+1) ans[i][j]=ans[i-1][j-1]-ans[i][j-1];
            bool res=dfs(i+1,border);
            if(res) return true;
        }
        return false;
    }

    void solve(){

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


        for(int border=7950000;border<=100000000;border+=100000){


            while(true){
                
                ans.assign(N,vector<mint>(N,0));
                ans[0][0]=rand_int(mod);

                bool res=dfs(0,border);

                if(res) break;
            }

            
            int now_score=0;

            rep(i,N){
                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)){
                best_ans=ans;
            }
        }

    }
}

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);
}