import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(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-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

# k桁まで
pc = [0]
for _ in range(16): pc += [c+1 for c in pc]

n = II()
ss = LLI(n)

dp = [[0]*n for _ in range(1 << n)]
for i in range(n):dp[1<<i][i]=1

for s in range(3, 1 << n):
    if pc[s]==1:continue
    for i in range(n):
        if s >> i & 1 == 0: continue
        p = pc[s]
        if p != p & -p: continue
        m = s ^ 1 << i
        t = m
        while t:
            if pc[t]*2 == p:
                for j in range(n):
                    if t>>j&1 and ss[i][j]:
                        dp[s][i]+=dp[s^t][i]*dp[t][j]*2
            t = (t-1) & m

print(*dp[-1],sep="\n")