from itertools import combinations N=int(input()) S=[] for _ in range(N): S.append(list(map(int,input().split()))) DP=[[0]*N for _ in range(1<<N)] for i in range(N): DP[1<<i][i]=1 popcount=[0]*(1<<N) for A in range(1,1<<N): a=A&(-A) popcount[A]=popcount[A^a]+1 E=[A for A in range(1,1<<N) if (popcount[A]==1 or popcount[A]==2 or popcount[A]==4 or popcount[A]==8) and popcount[A]<N] E.sort(key=lambda A:popcount[A]) for A in E: X=[]; Y=[] for a in range(N): if (A>>a)&1: X.append(a) else: Y.append(a) for B in combinations(Y,popcount[A]): T=0 for b in B: T|=1<<b for a in X: for b in B: if S[a][b]==1: DP[A|T][a]+=DP[A][a]*DP[T][b] else: DP[A|T][b]+=DP[A][a]*DP[T][b] print(*DP[-1],sep="\n")