#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector s(n, vector(n, 0)); REP(i, n) REP(j, n) cin >> s[i][j];
  vector dp(1 << n, vector(n, 0));
  REP(i, n) dp[1 << i][i] = 1;
  for (int i = 2; i <= n; i *= 2) {
    for (int subset = (1 << i) - 1; subset < (1 << n);) {
      vector<int> player;
      player.reserve(i);
      REP(i, n) {
        if (subset >> i & 1) player.emplace_back(i);
      }
      for (int subset2 = (1 << (i / 2)) - 1; subset2 < (1 << i);) {
        int x = 0, y = 0;
        REP(j, i) (subset2 >> j & 1 ? x : y) |= 1 << player[j];
        REP(p, n) {
          if (x >> p & 1) {
            REP(q, n) {
              if (y >> q & 1) dp[subset][s[p][q] == 1 ? p : q] += dp[x][p] * dp[y][q];
            }
          }
        }
        const int tmp1 = subset2 & -subset2, tmp2 = subset2 + tmp1;
        subset2 = (((subset2 & ~tmp2) / tmp1) >> 1) | tmp2;
      }
      const int tmp1 = subset & -subset, tmp2 = subset + tmp1;
      subset = (((subset & ~tmp2) / tmp1) >> 1) | tmp2;
    }
  }
  REP(i, n) cout << dp.back()[i] << '\n';
  return 0;
}