#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;
using ld = long double;
template <typename T>
using mat = vector<vector<T> >;
template <int mod>
struct modint {
  int x;
  modint() : x(0) {}
  modint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  modint &operator+=(const modint &p) {
    if ((x += p.x) >= mod) x -= mod;
    return *this;
  }
  modint &operator-=(const modint &p) {
    if ((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  modint &operator*=(const modint &p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  modint &operator/=(const modint &p) {
    *this *= p.inverse();
    return *this;
  }
  modint operator-() const { return modint(-x); }
  modint operator+(const modint &p) const { return modint(*this) += p; }
  modint operator-(const modint &p) const { return modint(*this) -= p; }
  modint operator*(const modint &p) const { return modint(*this) *= p; }
  modint operator/(const modint &p) const { return modint(*this) /= p; }
  bool operator==(const modint &p) const { return x == p.x; }
  bool operator!=(const modint &p) const { return x != p.x; }
  modint inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return modint(u);
  }
  modint pow(int64_t n) const {
    modint ret(1), mul(x);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
  friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }
  friend istream &operator>>(istream &is, modint &a) {
    int64_t t;
    is >> t;
    a = modint<mod>(t);
    return (is);
  }
  static int get_mod() { return mod; }
};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
T mypow(T x, ll n) {
  T ret = 1;
  while (n > 0) {
    if (n & 1) (ret *= x);
    (x *= x);
    n >>= 1;
  }
  return ret;
}
ll modpow(ll x, ll n, const ll mod) {
  ll ret = 1;
  while (n > 0) {
    if (n & 1) (ret *= x);
    (x *= x);
    n >>= 1;
    x %= mod;
    ret %= mod;
  }
  return ret;
}
uint64_t my_rand(void) {
  static uint64_t x = 88172645463325252ULL;
  x = x ^ (x << 13);
  x = x ^ (x >> 7);
  return x = x ^ (x << 17);
}
template <typename T>
struct edge {
  int src, to;
  T cost;
  edge(int to, T cost) : src(-1), to(to), cost(cost) {}
  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
  edge &operator=(const int &x) {
    to = x;
    return *this;
  }
  operator int() const { return to; }
};
template <typename T>
using Edges = vector<edge<T> >;
template <typename T>
using WeightedGraph = vector<Edges<T> >;
const long double eps = 0.001;
const long double PI = 3.141592653589793;
int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << setprecision(20);
  ll n;
  cin >> n;
  mat<int> relation(n, vector<int>(n));
  for (int i = (0), max_i = (n); i < max_i; i++)
    for (int j = (0), max_i = (n); j < max_i; j++) {
      char x;
      cin >> x;
      relation[i][j] = x - '0';
    }
  vector<int> comb(n, 1);
  ll l = n / 2, r = n - n / 2;
  for (int i = (0), max_i = (l); i < max_i; i++) comb[i] = 0;
  vector<ll> ans(1 << (n - 1));
  do {
    mat<ll> ans_left((1 << (l - 1)), vector<ll>(n)),
        ans_right((1 << (r - 1)), vector<ll>(n));
    vector<int> left, right;
    for (int i = (0), max_i = (n); i < max_i; i++) {
      if (comb[i] == 0)
        left.push_back(i);
      else
        right.push_back(i);
    }
    do {
      ll tmp = 0;
      for (int i = (0), max_i = (l - 1); i < max_i; i++) {
        tmp <<= 1;
        if (relation[left[i]][left[i + 1]] == 1) {
          tmp++;
        }
      }
      ans_left[tmp][left.back()]++;
    } while (next_permutation((left).begin(), (left).end()));
    do {
      ll tmp = 0;
      for (int i = (0), max_i = (r - 1); i < max_i; i++) {
        tmp <<= 1;
        if (relation[right[i]][right[i + 1]] == 1) {
          tmp++;
        }
      }
      ans_right[tmp][right[0]]++;
    } while (next_permutation((right).begin(), (right).end()));
    mat<ll> rsum0(n, vector<ll>(1 << (r - 1))),
        rsum1(n, vector<ll>(1 << (r - 1)));
    for (int i = (0), max_i = (n); i < max_i; i++)
      for (int j = (0), max_i = (n); j < max_i; j++)
        for (int bit = (0), max_i = (1 << (r - 1)); bit < max_i; bit++)
          if (relation[i][j] == 1) rsum1[i][bit] += ans_right[bit][j];
    for (int i = (0), max_i = (n); i < max_i; i++)
      for (int j = (0), max_i = (n); j < max_i; j++)
        for (int bit = (0), max_i = (1 << (r - 1)); bit < max_i; bit++)
          if (relation[i][j] == 0) rsum0[i][bit] += ans_right[bit][j];
    ll mask = (1 << (r - 1)) - 1;
    for (int s = (0), max_i = (1 << (n - 1)); s < max_i; s++) {
      ll l_bit = s >> r;
      ll r_bit = s & mask;
      if (s & (1 << (r - 1))) {
        for (int v : left) {
          ans[s] += rsum1[v][r_bit] * ans_left[l_bit][v];
        }
      } else {
        for (int v : left) {
          ans[s] += rsum0[v][r_bit] * ans_left[l_bit][v];
        }
      }
    }
  } while (next_permutation((comb).begin(), (comb).end()));
  for (int i = (0), max_i = (1 << (n - 1)); i < max_i; i++)
    cout << ans[i] << ' ';
  cout << '\n';
}
