#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

#define bit(b, i) (((b) >> (i)) & 1)

const int n = 16;
LL a[n][n];
map<LL, array<LL, 16>> dp[5];

int main() {
	inc(i, n) {
	inc(j, n) {
		cin >> a[i][j];
	}
	}
	inc(i, n) {
	inc(j, n) {
		if(a[i][j] == 0) { a[i][j] = -a[j][i]; }
	}
	}
	
	inc(i, n) { dp[0][1 << i][i] = 1; }
	inc(k, 4) {
		for(auto && e: dp[k]) {
		for(auto && g: dp[k]) {
			auto f = MP(g.FI, g.SE);
			if(k == 3) {
				int z = (~e.FI) & ((1 << n) - 1);
				f = MP(z, dp[k][z]);
			}
			
			if(e.FI & f.FI) { continue; }
			inc(x, n) { if(! bit(e.FI, x)) { continue; }
			inc(y, n) { if(! bit(f.FI, y)) { continue; }
				if(a[x][y] == +1) { dp[k + 1][e.FI | f.FI][x] += 2 * e.SE[x] * f.SE[y]; }
			}
			}
			
			if(k == 3) { break; }
		}
		}
	}
	
	inc(i, n) { cout << dp[4][(1 << n) - 1][i] << endl; }
	
	return 0;
}