#include <bits/stdc++.h>
using namespace std;
int l, r, n, j;
string a[20];
const int maxs = 1 << 14, maxb = 1 << 13;
vector<long long> dp[maxs][14];
long long f(int st, int en, int nd) {
  if (dp[st][en][nd] != -1) return dp[st][en][nd];
  long long ans = 0;
  if (__builtin_popcount(st) == 2) {
    int i = __builtin_ctz(st), j = __builtin_ctz(st - (1 << i));
    ans = nd == 1 ? a[i][j] == '1' : a[i][j] == '0';
  } else {
    int t = st - (1 << en);
    int last = nd & 1;
    for (int i = t; i > 0; i -= i & (-i)) {
      int j = __builtin_ctz(i);
      if ((last && a[en][j] == '1') || (!last && a[en][j] == '0'))
        ans += f(t, j, nd / 2);
    }
  }
  return dp[st][en][nd] = ans;
}
long long g(int subset, int need) {
  long long ans = 0;
  for (int i = subset; i > 0; i -= i & (-i)) {
    int j = __builtin_ctz(i);
    ans += dp[subset][j][need];
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  for (int i = 0; i < (n); ++i) cin >> a[i];
  if (n < -9) {
    vector<int> ans(1 << (n - 1), 0);
    int o[n], t;
    for (int i = 0; i < (n); ++i) o[i] = i;
    do {
      t = 0;
      for (int i = 0; i < (n - 1); ++i) {
        t *= 2;
        if (a[o[i]][o[i + 1]] == '1') t += 1;
      }
      ++ans[t];
    } while (next_permutation(o, o + n));
    for (int i = 0; i < (1 << (n - 1)); ++i) {
      cout << ans[i] << " \n"[i == (1 << (n - 1)) - 1];
    }
  } else {
    int tgt = (1 << n) - 1;
    for (int i = 0; i < (tgt + 1); ++i) {
      if (__builtin_popcount(i) < 2) continue;
      for (int j = 0; j < (n); ++j) {
        dp[i][j].resize(1 << (__builtin_popcount(i) - 1), 0);
      }
    }
    int st, j, en, bit;
    queue<int> q;
    vector<int> vis(1 << n, 0);
    for (int i = 0; i < (n); ++i) {
      for (int j = 0; j < (i); ++j) {
        st = (1 << i) | (1 << j);
        dp[st][i][1] = dp[st][j][1] = a[i][j] == '1';
        dp[st][i][0] = dp[st][j][0] = a[i][j] == '0';
        vis[st] = 1;
        q.push(st);
      }
    }
    while (!q.empty()) {
      st = q.front();
      q.pop();
      int o = __builtin_popcount(st), x = tgt - st;
      for (int t = x; t > 0; t -= t & (-t)) {
        j = __builtin_ctz(t);
        for (int u = st; u > 0; u -= u & (-u)) {
          en = __builtin_ctz(u);
          bit = a[en][j] == '1';
          for (int bm = 0; bm < (1 << (o - 1)); ++bm) {
            dp[st | (1 << j)][j][(bm << 1) | bit] += dp[st][en][bm];
          }
        }
        if (!vis[st | (1 << j)]) {
          q.push(st | (1 << j));
          vis[st | (1 << j)] = 1;
        }
      }
    }
    for (int i = 0; i < (1 << (n - 1)); ++i) {
      cout << g(tgt, i) << " \n"[i == (1 << (n - 1)) - 1];
    }
  }
}
