Problem: This is the easy version of the problem. The difference is constraints on the number of wise men and the time limit. You can make hacks only if all versions of this task are solved.

n wise men live in a beautiful city. Some of them know each other.

For each of the n! possible permutations p_1, p_2, …, p_n of the wise men, let's generate a binary string of length n-1: for each 1 ≤ i < n set s_i=1 if p_i and p_{i+1} know each other, and s_i=0 otherwise. 

For all possible 2^{n-1} binary strings, find the number of permutations that produce this binary string.

Input

The first line of input contains one integer n (2 ≤ n ≤ 14) — the number of wise men in the city.

The next n lines contain a binary string of length n each, such that the j-th character of the i-th string is equal to '1' if wise man i knows wise man j, and equals '0' otherwise.

It is guaranteed that if the i-th man knows the j-th man, then the j-th man knows i-th man and no man knows himself.

Output

Print 2^{n-1} space-separated integers. For each 0 ≤ x < 2^{n-1}:

  * Let's consider a string s of length n-1, such that s_i = ⌊ \frac{x}{2^{i-1}} ⌋ mod 2 for all 1 ≤ i ≤ n - 1. 
  * The (x+1)-th number should be equal to the required answer for s. 

Examples

Input


3
011
101
110


Output


0 0 0 6 


Input


4
0101
1000
0001
1010


Output


2 2 6 2 2 6 2 2 

Note

In the first test, each wise man knows each other, so every permutation will produce the string 11.

In the second test:

  * If p = \{1, 2, 3, 4\}, the produced string is 101, because wise men 1 and 2 know each other, 2 and 3 don't know each other, and 3 and 4 know each other; 
  * If p = \{4, 1, 2, 3\}, the produced string is 110, because wise men 1 and 4 know each other, 1 and 2 know each other and 2, and 3 don't know each other; 
  * If p = \{1, 3, 2, 4\}, the produced string is 000, because wise men 1 and 3 don't know each other, 3 and 2 don't know each other, and 2 and 4 don't know each other. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
string direc = "RDLU";
const long long MOD2 = (long long)1000000007 * (long long)1000000007;
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 1000000007) {
  x += y;
  if (x >= mod) x -= mod;
  if (x < 0) x += mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
char S[20][20];
long long dp[(1 << 14) + 135][20], g[20][(1 << 14) + 135];
int cc, cnt[(1 << 14) + 135];
map<vector<int>, long long> mpa;
vector<int> V;
inline void FWT_or(long long* A, const int fla, int lenth) {
  for (int i = 1; i < lenth; i <<= 1)
    for (int j = 0; j < lenth; j += (i << 1))
      for (int k = 0; k < i; k++) {
        if (fla == 1)
          A[j + k + i] += A[j + k];
        else
          A[j + k + i] -= A[j + k];
      }
}
long long t[20][(1 << 14) + 135], f[(1 << 14) + 135];
inline void dfs(int pre, int preSum) {
  if (preSum == n) {
    cc++;
    long long w = 0;
    int dep = (int)V.size();
    for (int i = 0; i < (1 << n); i++)
      if ((n - cnt[i]) & 1)
        w -= t[dep][i];
      else
        w += t[dep][i];
    mpa[V] = w;
    return;
  }
  for (int i = pre; i <= n - preSum; i++) {
    V.push_back(i);
    if (V.size() == 1) {
      for (int(z) = 0; (z) < (int)(1 << n); (z)++) t[1][z] = g[i][z];
    } else {
      int N = V.size();
      for (int(z) = 0; (z) < (int)(1 << n); (z)++)
        t[N][z] = t[N - 1][z] * g[i][z];
    }
    dfs(i, preSum + i);
    V.pop_back();
  }
}
void fmain(int tid) {
  scanf("%d", &n);
  for (int(i) = 0; (i) < (int)(n); (i)++) scanf("%s", S[i]);
  for (int(i) = 0; (i) < (int)(1 << n); (i)++) cnt[i] = __builtin_popcount(i);
  for (int s = 1; s < (1 << n); s++) {
    for (int(j) = 0; (j) < (int)(n); (j)++)
      if (s & (1 << j)) {
        int t = s ^ (1 << j);
        if (t == 0)
          dp[s][j] = 1;
        else {
          for (int(z) = 0; (z) < (int)(n); (z)++)
            if (dp[t][z] && S[z][j] == '1') {
              dp[s][j] += dp[t][z];
            }
        }
      }
  }
  for (int s = 1; s < (1 << n); s++) {
    for (int(j) = 0; (j) < (int)(n); (j)++) g[cnt[s]][s] += dp[s][j];
  }
  for (int(i) = 1; (i) <= (int)(n); (i)++) FWT_or(g[i], 1, 1 << n);
  dfs(1, 0);
  for (int(i) = 0; (i) < (int)(1 << (n - 1)); (i)++) {
    vector<int> vv;
    int pre = 1;
    for (int(j) = 0; (j) < (int)(n - 1); (j)++) {
      if ((i >> j) & 1) {
        pre++;
      } else {
        vv.push_back(pre);
        pre = 1;
      }
    }
    vv.push_back(pre);
    sort(vv.begin(), vv.end());
    assert(mpa.find(vv) != mpa.end());
    f[i] = mpa[vv];
  }
  for (int j = 0; j < n; j++) {
    for (int i = 1; i < (1 << n); i++) {
      if (i & (1 << j)) {
        f[i - (1 << j)] -= f[i];
      }
    }
  }
  for (int(i) = 0; (i) < (int)(1 << (n - 1)); (i)++) printf("%lld ", f[i]);
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}