from functools import lru_cache
import sys

int1 = lambda x: int(x) - 1

# input = lambda: sys.stdin.buffer.readline()
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
i1 = lambda: int1(input())
mi = lambda: map(int, input().split())
mi1 = lambda: map(int1, input().split())
li = lambda: list(mi())
li1 = lambda: list(mi1())
lli = lambda n: [li() for _ in range(n)]

INF = float("inf")
# mod = int(1e9 + 7)
mod = 998244353

N = ii()
win = [[j for j, x in enumerate(li()) if x == 1] for i in range(N)]

pcnt = [0] * (1 << N)
for bit in range(1 << N):
    x = bit
    while x:
        pcnt[bit] += x & 1
        x >>= 1
half = [list() for i in range(1 << N)]
for bit in range(1 << N):
    sub = bit
    while sub >= 0:
        sub &= bit
        if pcnt[sub] * 2 == pcnt[bit]:
            half[bit].append(sub)
        sub -= 1

dp = [[0] * N for i in range(1 << N)]
for bit in range(1 << N):
    if pcnt[pcnt[bit]] != 1:
        continue
    if pcnt[bit] == 1:
        dp[bit] = [bit >> i & 1 for i in range(N)]
    for sub in half[bit]:
        bus = bit ^ sub
        for i in range(N):
            for j in win[i]:
                dp[bit][i] += dp[sub][i] * dp[bus][j] * 2


for x in dp[(1 << N) - 1]:
    print(x)