N=int(input())
S=[list(map(int,input().split())) for i in range(N)]
M=1<<N
DP=[[0]*N for i in range(M)]
F=[0]*M
B=[bin(i).count('1') for i in range(M)]
def f(X):
  if F[X]:
    return DP[X][:]
  if (X&(-X))==X:
    DP[X][X.bit_length()-1]=1
    F[X]=1
    return DP[X][:]
  v=0
  while 1:
    v=(v-1)&X
    if B[v]==B[v^X]:
      a,b=f(v),f(v^X)
      for i in range(N):
        if a[i]:
          for j in range(N):
            if b[j]:
              if S[i][j]:
                DP[X][i]+=a[i]*b[j]
              else:
                DP[X][j]+=a[i]*b[j]
    if v==0:
      break
  F[X]=1
  return DP[X][:]

f(M-1)
for i in range(N):
  print(DP[M-1][i])