#include <bits/stdc++.h>
using namespace std;
const int maxN = 18;
int n;
vector<int> get_part(int msk) {
  int cur = 1;
  vector<int> all;
  for (int i = 0; i < (n - 1); i++) {
    if (msk & (1 << i)) {
      cur++;
    } else {
      if (cur) {
        all.emplace_back(cur);
        cur = 1;
      }
    }
  }
  all.emplace_back(cur);
  sort(all.begin(), all.end());
  return all;
}
map<vector<int>, long long> mp;
char c[maxN][maxN];
long long dp[(1 << maxN) + 2][maxN];
long long val[(1 << maxN) + 2];
int bts[(1 << maxN) + 2];
long long cp[(1 << maxN) + 2];
void init() {
  memset(dp, 0, sizeof dp);
  for (int i = 0; i < n; i++) dp[(1 << i)][i] = 1;
  for (int mask = 0; mask < (1 << n); mask++) {
    for (int lst = 0; lst < n; lst++) {
      if (!dp[mask][lst]) continue;
      for (int nxt = 0; nxt < n; nxt++) {
        if (mask & (1 << nxt)) continue;
        if (c[lst][nxt] == '0') continue;
        dp[mask | (1 << nxt)][nxt] += dp[mask][lst];
      }
    }
  }
  for (int mask = 0; mask < (1 << n); mask++) {
    for (int bit = 0; bit < n; bit++) {
      if (mask & (1 << bit)) cp[mask] += dp[mask][bit];
    }
  }
}
long long fft[maxN + 1][(1 << maxN) + 2];
void do_or(int bit) {
  for (int mask = 0; mask < (1 << n); mask++) {
    if (bts[mask] == bit)
      fft[bit][mask] = cp[mask];
    else
      fft[bit][mask] = 0;
  }
  for (int c = 0; c < n; c++) {
    for (int mask = 0; mask < (1 << n); mask++) {
      if (mask & (1 << c)) {
        fft[bit][mask] += fft[bit][mask ^ (1 << c)];
      }
    }
  }
}
long long cur[(1 << maxN) + 2];
long long go(vector<int>& c) {
  memset(cur, 0, sizeof cur);
  for (int mask = 0; mask < (1 << n); mask++) {
    cur[mask] = 1;
    for (int v : c) {
      cur[mask] *= fft[v][mask];
    }
  }
  long long x = 0;
  int all = (1 << n) - 1;
  for (int mask = 0; mask < (1 << n); mask++) {
    if (bts[mask ^ all] & 1)
      x -= cur[mask];
    else
      x += cur[mask];
  }
  return x;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  bts[0] = 0;
  cin >> n;
  for (int i = 1; i < (1 << n); i++) bts[i] = bts[i / 2] + (i & 1);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> c[i][j];
    }
  }
  init();
  for (int i = 1; i <= n; i++) do_or(i);
  for (int i = 0; i < (1 << (n - 1)); i++) {
    auto it = get_part(i);
    if (mp.find(it) == mp.end()) {
      long long d = go(it);
      val[i] = d;
      mp[it] = d;
    } else {
      val[i] = mp[it];
    }
  }
  for (int bit = 0; bit < (n - 1); bit++) {
    for (int mask = 0; mask < (1 << (n - 1)); mask++) {
      if (mask & (1 << bit)) {
        val[mask ^ (1 << bit)] -= val[mask];
      }
    }
  }
  for (int i = 0; i < (1 << (n - 1)); i++) cout << val[i] << " ";
  return 0;
}
