#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

int N = 16;
int B[16][16];
vector<pi> P[4];
ll D[5][(1 << 20)];
vector<int> on[(1 << 16)];
ll ans[16];

int winner(int a, int b) {
	if(a > b) swap(a, b);
	return B[a][b] > 0 ? a : b;
}

void solve() {
	rep(i, 0, N)
		rep(j, 0, N) cin >> B[i][j];
	rep(bit, 0, (1 << N)) {
		for(int to = bit; to; to = (to - 1) & bit) {
			int c1 = __builtin_popcount(to), c2 = __builtin_popcount(bit ^ to);
			if(c1 != c2) continue;
			rep(k, 0, 4) {
				if(c1 == (1 << k) && c2 == (1 << k)) {
					P[k].pb(pi(to, bit ^ to));
				}
			}
		}
	}
	rep(bit, 0, (1 << N)) {
		rep(i, 0, N) {
			if(bit & (1 << i)) on[bit].pb(i);
		}
	}
	rep(i, 0, N) D[0][(1 << (i + 4)) + i] = 1;
	rep(i, 0, 4) {
		for(auto p: P[i]) {
			int lbit = p.fst, rbit = p.sec;
			rep(j, 0, sz(on[lbit])) {
				rep(k, 0, sz(on[rbit])) {
					D[i + 1][(lbit | rbit) * 16 + winner(on[lbit][j], on[rbit][k])] 
						+= D[i][lbit * 16 + on[lbit][j]] * D[i][rbit * 16 + on[rbit][k]];
				}
			}
		}
	}
	rep(i, 0, (1 << (N + 4))) ans[i % 16] += D[4][i];
	rep(i, 0, 16) cout << ans[i] << "\n";
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}