import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum N = 16;

int[][] A;

void main() {
  try {
    for (; ; ) {
      A = new int[][](N, N);
      foreach (u; 0 .. N) foreach (v; 0 .. N) {
        A[u][v] = readInt();
      }
      foreach (u; 0 .. N) foreach (v; 0 .. u) {
        A[u][v] = -A[v][u];
      }
      
      auto dp = new long[][](1 << N, N);
      foreach (u; 0 .. N) {
        dp[1 << u][u] = 1;
      }
      foreach (p; 1 .. 1 << N) {
        const l = popcnt(p);
        if (!(l & (l - 1))) {
          for (int q = p; ; --q &= p) {
            if (popcnt(q) == l / 2) {
              foreach (u; 0 .. N) {
                if ((q >> u) & 1) {
                  foreach (v; 0 .. N) {
                    if (((p ^ q) >> v) & 1) {
                      dp[p][(A[u][v] > 0) ? u : v] += dp[q][u] * dp[p ^ q][v];
                    }
                  }
                }
              }
            }
            if (q == 0) {
              break;
            }
          }
        }
      }
      foreach (u; 0 .. N) {
        writeln(dp[(1 << N) - 1][u]);
      }
    }
  } catch (EOFException e) {
  }
}