from functools import lru_cache


N=int(input())
S=[list(map(int,input().split())) for i in range(N)]
bit_set=[[] for n in range(N+1)]
for N in range(N+1):
    for bit in range(1<<N):
        idx0,idx1=[],[]
        for i in range(N):
            if bit&1<<i:
                idx0.append(i)
            else:
                idx1.append(i)
        if len(idx0)==len(idx1):
            bit_set[N].append((idx0,idx1))
@lru_cache(maxsize=None)
def solve(idx):
    rev_idx=[None]*N
    for i in range(len(idx)):
        rev_idx[idx[i]]=i
    if len(idx)==1:
        retu=[1]
    else:
        retu=[0]*len(idx)
        for idx0,idx1 in bit_set[len(idx)]:
            retu0=solve(tuple([idx[i] for i in idx0]))
            retu1=solve(tuple([idx[i] for i in idx1]))
            for i in range(len(idx0)):
                for j in range(len(idx1)):
                    if S[idx[idx0[i]]][idx[idx1[j]]]:
                        retu[idx0[i]]+=retu0[i]*retu1[j]
                    else:
                        retu[idx1[j]]+=retu0[i]*retu1[j]
    return retu
ans_lst=solve(tuple([i for i in range(N)]))
for ans in ans_lst:
    print(ans)