import sys
input = sys.stdin.readline

def subset(N, k):
    S = (1<<k)-1
    st = []
    while S < (1<<N):
        st.append(S)
        x = S & -S
        y = S + x
        S = ((S & ~y) // x >> 1) | y
    return st

N = int(input())
S = [list(map(int, input().split())) for _ in range(N)]
dp = [[0] * N for _ in range(1<<N)]
# dp[S][i] = number of ways where i wins the tournament of people in S
for i in range(N):
    dp[1<<i][i] = 1
k = 0
while 2**k < N:
    st = subset(N, 2**k)
    for l, X in enumerate(st):
        for Y in st[l+1:]:
            if X&Y:
                continue
            for i in range(N):
                if X>>i&1:
                    for j in range(N):
                        if Y>>j&1:
                            dp[X|Y][i if S[i][j] else j] += dp[X][i] * dp[Y][j] * 2
    k += 1
for i in range(N):
    print(dp[-1][i])