import java.util.Arrays;

public class Main {

  static int n = 16;
  static long[][] dp = new long[1 << n][n];

  private static void solve() {
    int[][] a = ntable(n, n);
    for (long[] v : dp) Arrays.fill(v, -1);

    for (int i = 0; i < n; i ++) {
      for (int j = i + 1; j < n; j ++) {
        if (a[i][j] == 1) {
          dp[(1 << i) | (1 << j)][i] = 2;
          dp[(1 << i) | (1 << j)][j] = 0;
        } else {
          dp[(1 << i) | (1 << j)][i] = 0;
          dp[(1 << i) | (1 << j)][j] = 2;
        }
      }
    }
    for (int i = 0; i < n; i ++) {
      System.out.println(dfs((1 << n) - 1, i));
    }
  }

  private static long dfs(int last, int i) {
    if (dp[last][i] >= 0) {
      return dp[last][i];
    }

    int x = last;
    int bc = Integer.bitCount(last);
    
    long ret = 0;
    while (x > 0) {
      x = (x - 1) & last;
      
      if (((x >> i) & 1) == 1 && Integer.bitCount(x) == bc / 2) {
        int y = (~x) & last;
        int z = x;

        long sum = 0;
        for (int j = 0; j < n; j ++) {
          if (((y >> j) & 1) == 1 && dp[(1 << i) | (1 << j)][i] > 0) {
            sum += dfs(y, j);
          }
        }
        ret += dfs(z, i) * sum * 2;
      }
    }
    dp[last][i] = ret;
    return ret;
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}