// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}

int n = 16;
int a[16][16];
ll dp[16][1<<16];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  for(int i = 0; i < n; i++){
    for(int j = 0; j < n; j++){
      cin >> a[i][j];
      if(i > j)a[i][j] = - a[j][i];
    }
  }
  set<int> st;
  for(int i = 0; i <= 4; i++)st.insert(1<<i);
  for(int i = 0; i < (1 << 16); i++){
    int nx = __builtin_popcount(i);
    if(st.find(nx) == st.end())continue;
    if(nx == 1){
      for(int j = 0; j < n; j++){
        if((i >> j) % 2 == 1){
          dp[j][i] = 1;
          break;
        }
      }
      continue;
    }
    for(int j = i; ; j=(j-1)&i){
      if(j == 0)break;
      if(__builtin_popcount(j) * 2 != nx)continue;
      int jt = i & (~(j));
      vector<int> v, vt;
      for(int k = 0; k < n; k++){
        if((j >> k) % 2 == 1)v.pb(k);
        if((jt >> k) % 2 == 1)vt.pb(k);
      }
      for(auto c: v){
        for(auto d: vt){
          if(a[c][d] > 0)dp[c][i] += dp[c][j] * dp[d][jt];
          else dp[d][i] += dp[c][j] * dp[d][jt];
        }
      }
    }
  }
  for(int i = 0; i < n; i++){
    cout << dp[i][(1<<16)-1] << endl;
  }
	return 0;
}