#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

ll fact[17],dp[16][65536];
int n=16,m=65536,a[16][16];

ll rec(int k,int mask){
    if(dp[k][mask]!=-1)return dp[k][mask];
    int cnt=__builtin_popcount(mask);
    if(cnt==1)return 1;
    int bit=mask^(1<<k);
    ll sum=0;
    for(int i=bit;i>=0;i--){
        i&=bit;
        int c=__builtin_popcount(i);
        if(2*c!=cnt)continue;
        ll res=0;
        rep(j,16)if((i&(1<<j))&&a[k][j]==1)res+=rec(j,i);
        res*=rec(k,mask-i);
        res*=2;
        sum+=res;
    }
    return dp[k][mask]=sum;
}


int main(){
    fact[0]=1;
    rep(i,n)fact[i+1]=fact[i]*(i+1);
    rep(i,n)rep(j,m)dp[i][j]=-1;
    rep(i,n)rep(j,n){
        cin>>a[i][j];
        if(i>j)a[i][j]=-a[j][i];
    }
    rep(i,n)cout<<rec(i,m-1)<<endl;
    return 0;
}