import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = (1 << 63)-1
inf = (1 << 32)-1
# md = 10**9+7
md = 998244353

pc = [0]
for _ in range(16): pc += list(map(lambda x: x+1, pc))
ss = [[] for _ in range(17)]
for s in range(1 << 16): ss[pc[s]].append(s)

aa = LLI(16)

dp = [[0]*(1 << 16) for _ in range(16)]
for i in range(16):
    s = 1 << i
    for j in range(i+1, 16):
        if aa[i][j] == -1:
            aa[i][j] = 0
            aa[j][i] = 1
        if aa[i][j]:
            dp[i][s | 1 << j] = 2
        else:
            dp[j][s | 1 << j] = 2

for c in [4, 8, 16]:
    for s in ss[c]:
        for t in ss[c//2]:
            if s & t != t: continue
            u = s ^ t
            if t > u: continue
            for i in range(16):
                if t >> i & 1 == 0: continue
                for j in range(16):
                    if u >> j & 1 == 0: continue
                    if aa[i][j]:
                        dp[i][s] += dp[i][t]*dp[j][u]*2
                    else:
                        dp[j][s] += dp[i][t]*dp[j][u]*2

for i in range(16): print(dp[i][-1])