#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int a[16][16];
	rep(i, 16)rep(j, 16) cin >> a[i][j];
	rep(i, 16)rep2(j, i + 1, 16) a[j][i] -= a[i][j];
	vector<vector<long long>>v(17);
	rep(i, 17) {
		vector<long long>vec(16);
		rep(j, i)vec[j] = 1;
		sort(all(vec));
		do {
			int bit = 0;
			rep(j, 16) {
				bit *= 2;
				bit += vec[j];
			}
			v[i].push_back(bit);
		} while (next_permutation(vec.begin(), vec.end()));
	}
	vector<vector<long long>>dp(1 << 16, vector<long long>(16));
	rep(i, 16)rep2(j, i + 1, 16) {
		vector<long long>vec(16);
		if (1 == a[i][j])vec[i] = 2;
		else vec[j] = 2;
		dp[(1 << i) + (1 << j)] = vec;
	}
	for (int i = 4; i <= 16; i *= 2) {
		rep(j, v[i].size()) {
			int bit = v[i][j];
			rep(k, v[i / 2].size()) {
				int x = v[i / 2][k];
				int y = bit ^ x;
				if (x != (x & bit))continue;
				rep(l, 16)rep(m, 16) {
					if (1 == a[l][m])dp[bit][l] += dp[x][l] * dp[y][m];
					else dp[bit][m] += dp[x][l] * dp[y][m];
				}
			}
		}
	}
	rep(i, 16) cout << dp[(1 << 16) - 1][i] << endl;
	return 0;
}