#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool upmin(T &x, T y) {
  return y <= x ? x = y, 1 : 0;
}
template <typename T>
inline bool upmax(T &x, T y) {
  return x <= y ? x = y, 1 : 0;
}
const long double eps = 1e-9;
const long double pi = acos(-1);
const int oo = 1 << 30;
const long long loo = 1ll << 60;
const int MAXN = 1 << 18;
const int MAXM = 2000005;
const int MX = 5000;
const int mods = 998244353;
const int SZ = 131;
const int inv2 = (mods + 1) >> 1;
const int INF = 0x3f3f3f3f;
namespace FastIO {
constexpr int SIZE = (1 << 21) + 1;
int num = 0, f;
char ibuf[SIZE], obuf[SIZE], que[65], *iS, *iT, *oS = obuf,
                                                *oT = obuf + SIZE - 1, c;
inline void flush() {
  fwrite(obuf, 1, oS - obuf, stdout);
  oS = obuf;
}
inline void putc(char c) {
  *oS++ = c;
  if (oS == oT) flush();
}
inline void getc(char &c) {
  for (c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++);
       !isdigit(c) && c != EOF;
       c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    ;
}
inline void reads(char *st) {
  char c;
  int n = 0;
  getc(st[++n]);
  for (c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++);
       isdigit(c);
       c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    st[++n] = c;
  st[++n] = '\0';
}
template <class I>
inline void read(I &x) {
  for (f = 1, c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                              (iS == iT ? EOF : *iS++))
                            : *iS++);
       c < '0' || c > '9';
       c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    if (c == '-') f = -1;
  for (x = 0; c >= '0' && c <= '9';
       c = (iS == iT ? (iT = ((iS = ibuf) + fread(ibuf, 1, SIZE, stdin)),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    x = (x << 3) + (x << 1) + (c & 15);
  x *= f;
}
template <class I>
inline void print(I x) {
  if (x < 0) putc('-'), x = -x;
  if (!x) putc('0');
  while (x) que[++num] = x % 10 + 48, x /= 10;
  while (num) putc(que[num--]);
}
inline void putstr(string st) {
  for (int i = 0; i < (int)st.size(); ++i) putc(st[i]);
}
struct Flusher_ {
  ~Flusher_() { flush(); }
} io_Flusher_;
}  // namespace FastIO
using FastIO ::print;
using FastIO ::putc;
using FastIO ::putstr;
using FastIO ::read;
using FastIO ::reads;
char st[20];
vector<int> V;
long long F[20][MAXN], h[20][MAXN], g[MAXN][20], f[MAXN];
int n, cnt[MAXN], flag[20][20];
map<vector<int>, long long> Map;
void FWT(long long *A, int n) {
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < 1 << n; ++j)
      if ((j >> i) & 1) A[j] += A[j ^ (1 << i)];
}
void IFWT(long long *A, int n) {
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < 1 << n; ++j)
      if ((j >> i) & 1) A[j ^ (1 << i)] -= A[j];
}
void dfs(int len, int x, int lst) {
  if (x == n) {
    long long sum = 0;
    for (int i = 0; i < 1 << n; ++i) {
      if ((n - cnt[i]) & 1)
        sum -= F[len][i];
      else
        sum += F[len][i];
    }
    Map[V] = sum;
    return;
  }
  for (int i = lst; i <= n - x; ++i) {
    for (int j = 0; j < 1 << n; ++j) F[len + 1][j] = F[len][j] * h[i][j];
    V.push_back(i);
    dfs(len + 1, x + i, i);
    V.pop_back();
  }
}
signed main() {
  read(n);
  for (int i = 1; i <= n; ++i) {
    reads(st);
    for (int j = 1; j <= n; ++j) flag[i - 1][j - 1] = (st[j] - '0');
  }
  for (int i = 1; i < 1 << n; ++i) cnt[i] = cnt[i >> 1] + (i & 1);
  for (int i = 0; i < n; ++i) g[1 << i][i] = 1;
  for (int i = 1; i < 1 << n; ++i) {
    for (int j = 0; j < n; ++j)
      if ((i >> j) & 1) {
        for (int k = 0; k < n; ++k)
          if (!((i >> k) & 1) && flag[j][k]) g[i | (1 << k)][k] += g[i][j];
        h[cnt[i]][i] += g[i][j];
      }
  }
  for (int i = 1; i <= n; ++i) FWT(h[i], n);
  for (int i = 0; i < 1 << n; ++i) F[0][i] = 1;
  dfs(0, 0, 1);
  for (int i = 0; i < 1 << (n - 1); ++i) {
    V.clear();
    int num = 1;
    for (int j = 0; j < n - 1; ++j) {
      if (!((i >> j) & 1)) V.push_back(num), num = 0;
      ++num;
    }
    V.push_back(num);
    sort(V.begin(), V.end());
    f[i] = Map[V];
  }
  IFWT(f, n - 1);
  for (int i = 0; i < 1 << (n - 1); ++i) print(f[i]), putc(' ');
  return 0;
}
