#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
using namespace std;
using ll = long long int;

const int N = 16;
ll match[20][20], dp[1 << 16], frac[20];

int main() {
    frac[0] = 1;
    for(int i=1; i<=N; i++) {
        frac[i] = frac[i-1] * i;
    }

    for(int i=0; i<N; i++) {
        for(int j=0; j<N; j++) {
            cin >> match[i][j];
            if(i > j) match[i][j] = -match[j][i];
        }
    }

    dp[(1<<N) - 1] = 1;
    for(int bit=(1<<N)-1; bit>0; bit--) {
        if(dp[bit] == 0) continue;
        int popBit = __builtin_popcount(bit);
        for(int par=bit; par>0; par=(par-1)&bit) {
            int popPar = __builtin_popcount(par);
            if(popPar != popBit / 2) continue;
        
            // 勝者と敗者
            vector<int> winner, loser;
            for(int i=0; i<N; i++) {
                if(par >> i & 1)      winner.push_back(i);
                else if(bit >> i & 1) loser.push_back(i);
            }

            // 敗者の集合
            int M = popPar;
            vector<ll> dp2(1 << M);
            dp2[0] = 1;
            for(int mask=0; mask<(1 << M); mask++) {
                int idx = __builtin_popcount(mask);
                // winner[idx] vs loser[jdx]
                for(int jdx=0; jdx<M; jdx++) {
                    if(mask >> jdx & 1) continue;
                    int nmask = mask | (1 << jdx);

                    int A = winner[idx], B = loser[jdx];
                    if(match[A][B] == 1) {
                        dp2[nmask] += dp2[mask];
                    }
                }
            }

            ll addVal = dp2[(1 << M) - 1] * dp[bit];
            addVal *= (1 << M);
            // addVal *= frac[M];
            dp[par] += addVal;
        }
    }

    /*
    for(int i=0; i<(1<<N); i++) {
        if(dp[i] == 0) continue;
        cout << "dp[" << bitset<N>(i).to_string() << "] = " << dp[i] << endl;
    }
    */

    for(int i=0; i<N; i++) {
        cout << dp[1 << i] << endl;
    }
    return 0;
}