from functools import lru_cache

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