from collections import Counter

N=int(input())
S=[list(map(int,input().split())) for i in range(N)]

ANS=[0]*N

def listbit(x):
    for i in range(1<<x):
        count=0
        for j in range(x):
            if i & (1<<j) != 0:
                count+=1
        if count==x//2 and i & (1<<0)==0:
            yield i

LBIT=[-1]*20

LBIT[2]=list(listbit(2))
LBIT[4]=list(listbit(4))
LBIT[8]=list(listbit(8))
LBIT[16]=list(listbit(16))
            

def win(x,y):
    if S[x][y]==1:
        return x
    else:
        return y

def calc(X,f):
    if len(X)==2:
        a,b=X[0],X[1]

        DX=Counter()

        if S[a][b]==1:
            DX[a]=f
        else:
            DX[b]=f
        return DX
        
    DD=Counter()

    for i in LBIT[len(X)]:
        Y=[]
        Z=[]

        for j in range(len(X)):
            if i & (1<<j) == 0:
                Y.append(X[j])
            else:
                Z.append(X[j])

        #print("!",Y,Z)

        if len(Y)==len(X)//2:
            #print(Y,Z)
            D1=calc(Y,f)
            D2=calc(Z,f)

            for d1 in D1:
                for d2 in D2:
                    DD[win(d1,d2)]+=D1[d1]*D2[d2]

    return DD
            


D=calc(list(range(N)),1)

if N==2:
    k=2
elif N==4:
    k=4*2
elif N==8:
    k=16*8
else:
    k=16*16*128

for i in range(N):
    print(D[i]*k)