#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class t, class u>
void chmax(t& first, u second) {
  if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
  if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vc<vc<t>>;
using pi = pair<ll, ll>;
using vi = vc<ll>;
template <class t, class u>
ostream& operator<<(ostream& os, const pair<t, u>& p) {
  return os << "{" << p.first << "," << p.second << "}";
}
template <class t>
ostream& operator<<(ostream& os, const vc<t>& v) {
  os << "{";
  for (auto e : v) os << e << ",";
  return os << "}";
}
using uint = unsigned;
using ull = unsigned long long;
template <class t, size_t n>
ostream& operator<<(ostream& os, const array<t, n>& first) {
  return os << vc<t>(first.begin(), first.end());
}
template <ll i, class T>
void print_tuple(ostream&, const T&) {}
template <ll i, class T, class H, class... Args>
void print_tuple(ostream& os, const T& t) {
  if (i) os << ",";
  os << get<i>(t);
  print_tuple<i + 1, T, Args...>(os, t);
}
template <class... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
  os << "{";
  print_tuple<0, tuple<Args...>, Args...>(os, t);
  return os << "}";
}
template <class t>
void print(t x, ll suc = 1) {
  cout << x;
  if (suc == 1) cout << "\n";
  if (suc == 2) cout << " ";
}
ll read() {
  ll i;
  cin >> i;
  return i;
}
vi readvi(ll n, ll off = 0) {
  vi v(n);
  for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off;
  return v;
}
template <class T>
void print(const vector<T>& v, ll suc = 1) {
  for (ll i = ll(0); i < ll(v.size()); i++)
    print(v[i], i == ll(v.size()) - 1 ? suc : 2);
}
string readString() {
  string s;
  cin >> s;
  return s;
}
template <class T>
T sq(const T& t) {
  return t * t;
}
void yes(bool ex = true) {
  cout << "Yes"
       << "\n";
  if (ex) exit(0);
}
void no(bool ex = true) {
  cout << "No"
       << "\n";
  if (ex) exit(0);
}
void possible(bool ex = true) {
  cout << "Possible"
       << "\n";
  if (ex) exit(0);
}
void impossible(bool ex = true) {
  cout << "Impossible"
       << "\n";
  if (ex) exit(0);
}
constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; }
const ll infLL = LLONG_MAX / 3;
const ll inf = infLL;
ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); }
ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); }
ll popcount(signed t) { return __builtin_popcount(t); }
ll popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(ll i) { return i && (i & -i) == i; }
ll mask(ll i) { return (ll(1) << i) - 1; }
bool inc(ll first, ll second, ll c) { return first <= second && second <= c; }
template <class t>
void mkuni(vc<t>& v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
ll rand_int(ll l, ll r) {
  static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
  return uniform_int_distribution<ll>(l, r)(gen);
}
template <class t>
void myshuffle(vc<t>& first) {
  for (ll i = ll(0); i < ll(ll(first.size())); i++)
    swap(first[i], first[rand_int(0, i)]);
}
template <class t>
ll lwb(const vc<t>& v, const t& first) {
  return lower_bound(v.begin(), v.end(), first) - v.begin();
}
const ll nmax = 18;
bool g[nmax][nmax];
ll dp[1 << nmax][nmax];
ll trans[nmax + 1][1 << nmax];
ll buf[nmax + 1][1 << nmax];
ll wei[1 << nmax];
ll ans[1 << nmax];
void dfs(ll n, ll rem, ll mx, ll d, vi& cur) {
  if (rem == 0) {
    void(0);
    ll val = 0;
    for (ll bit = ll(0); bit < ll(1 << n); bit++) val += wei[bit] * buf[d][bit];
    void(0);
    reverse(cur.begin(), cur.end());
    assert(is_sorted(cur.begin(), cur.end()));
    do {
      ll z = 0;
      for (auto v : cur) {
        z <<= 1;
        for (ll _ = ll(0); _ < ll(v - 1); _++) {
          z <<= 1;
          z++;
        }
      }
      ans[z] += val;
    } while (next_permutation(cur.begin(), cur.end()));
    reverse(cur.begin(), cur.end());
    return;
  }
  for (ll nx = ll(1); nx < ll(min(mx, rem) + 1); nx++) {
    for (ll bit = ll(0); bit < ll(1 << n); bit++)
      buf[d + 1][bit] = buf[d][bit] * trans[nx][bit];
    cur.push_back(nx);
    dfs(n, rem - nx, nx, d + 1, cur);
    cur.pop_back();
  }
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);
  ll n;
  cin >> n;
  bool dbg = n < 0;
  if (dbg) {
    n = -n;
  } else {
    for (ll i = ll(0); i < ll(n); i++) {
      string s;
      cin >> s;
      for (ll j = ll(0); j < ll(n); j++) g[i][j] = s[j] == '1';
    }
  }
  for (ll i = ll(0); i < ll(n); i++) dp[1 << i][i] = 1;
  for (ll bit = ll(0); bit < ll(1 << n); bit++) {
    for (ll i = ll(0); i < ll(n); i++)
      if (bit & 1 << i) {
        for (ll j = ll(0); j < ll(n); j++)
          if (!(bit & 1 << j) && g[i][j]) dp[bit | 1 << j][j] += dp[bit][i];
        trans[popcount(bit)][bit] += dp[bit][i];
      }
  }
  for (ll cnt = ll(1); cnt < ll(n + 1); cnt++)
    for (ll i = ll(0); i < ll(n); i++)
      for (ll bit = ll(0); bit < ll(1 << n); bit++)
        if (!(bit & 1 << i)) trans[cnt][bit | 1 << i] += trans[cnt][bit];
  for (ll bit = ll(0); bit < ll(1 << n); bit++) buf[0][bit] = 1;
  for (ll bit = ll(0); bit < ll(1 << n); bit++)
    wei[bit] = (n - popcount(bit)) % 2 == 0 ? 1 : -1;
  vi tmp;
  dfs(n, n, n, 0, tmp);
  for (ll i = ll(0); i < ll(n - 1); i++)
    for (ll bit = ll(0); bit < ll(1 << (n - 1)); bit++)
      if (bit & 1 << i) {
        ans[bit ^ 1 << i] -= ans[bit];
      }
  for (ll bit = ll(0); bit < ll(1 << (n - 1)); bit++)
    print(ans[bit], bit == mask(n - 1) ? 1 : 2);
}
