#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

int main(){
  ll n;cin >> n;
  vvl v(n,vl(n));
  rep(i,n)rep(j,n)cin >> v[i][j];
  vvl dp(1<<n,vl(n));
  rep(i,n)dp[1<<i][i]=1;
  rep(bit,1<<n){
    ll ssp=__builtin_popcount(bit);
    for(ll cit=bit;cit>=0;cit--){
      cit&=bit;
      if(__builtin_popcount(cit)*2!=ssp)continue;
      rep(i,n){
        if(dp[cit][i]==0)continue;
        rep(j,n){
          if(v[i][j])dp[bit][i]+=dp[cit][i]*dp[bit^cit][j];
          else dp[bit][j]+=dp[cit][i]*dp[bit^cit][j];
        }
      }
    }
  }
  for(auto p:dp.back())cout << p << endl;
  /*rep(bit,1<<n){
    rep(j,n)cout << dp[bit][j] <<" ";cout << endl;
  }*/
}