#include <bits/stdc++.h>

using namespace std;

using ll = long long;

ll dp[1 << 16][16];
int a[16][16];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    for (int i = 0; i < 16; i++) {
        for (int j = 0; j < 16; j++) {
            cin >> a[i][j];
        }
    }

    vector< vector<int> > memo(17);
    for (int i = 1; i < (1 << 16); i++) {
        int cnt = __builtin_popcount(i);
        memo[cnt].push_back(i);
    }

    for (int i = 0; i < 16; i++) {
        dp[1 << i][i] = 1;
    }

    for (int cnt : {1, 2, 4}) {
        for (int i : memo[cnt]) {
            for (int j : memo[cnt]) {
                if (i & j) continue;
                for (int k = 0; k < 16; k++) {
                    if (i & (1 << k)) {
                        for (int l = 0; l < 16; l++) {
                            if (j & (1 << l)) {
                                int winner;
                                if (k < l) {
                                    winner = (a[k][l] == 1 ? k : l); 
                                } else {
                                    winner = (a[l][k] == 1 ? l : k); 
                                }
                                dp[(i | j)][winner] += dp[i][k] * dp[j][l];
                            }
                        }
                    }
                }
            }
        }
    }

    for (int i : memo[8]) {
        int j = (1 << 16) - 1;
        j ^= i;
        for (int k = 0; k < 16; k++) {
            if (i & (1 << k)) {
                for (int l = 0; l < 16; l++) {
                    if (j & (1 << l)) {
                        int winner;
                        if (k < l) {
                            winner = (a[k][l] == 1 ? k : l); 
                        } else {
                            winner = (a[l][k] == 1 ? l : k); 
                        }
                        dp[(i | j)][winner] += dp[i][k] * dp[j][l];
                    }
                }
            }
        }     
    }

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