#include<bits/stdc++.h>

using namespace std;

const int mod = 1e9 + 7;

int N;
string S[20];
int dat[20][20];

int main()
{
  cin >> N;
  for(int i = 0; i < N; i++) {
    cin >> S[i];
    S[i] += "*";
  }

  for(int i = 0; i < N; i++) {
    for(int j = 0; j < N; j++) {
      if(i == j) continue;
      int diff = 0;
      while(S[i][diff] == S[j][diff]) ++diff;
      dat[i][j] = diff + 1;
    }
  }

  int dp[1 << 20] = {}, comb[1 << 20] = {};
  dp[0] = 0;
  comb[0] = 1;

  for(int i = 0; i < (1 << N); i++) {

    vector< int > yuki(N, 1);
    for(int j = 0; j < N; j++) {
      if(!((i >> j) & 1)) {
        for(int k = 0; k < N; k++) {
          if(!((i >> k) & 1)) yuki[j] = max(yuki[j], dat[j][k]);
        }
      }
    }

    for(int j = 0; j < N; j++) {
      if((i >> j) & 1) continue;
      (comb[i | (1 << j)] += comb[i]) %= mod;
      (dp[i | (1 << j)] += (dp[i] + 1LL * yuki[j] * comb[i] % mod) % mod) %= mod;
    }
  }


  vector< int > ans(N, 0);
  for(int i = 0; i < (1 << N); i++) {
    (ans[__builtin_popcount(i) - 1] += dp[i]) %= mod;
  }
  for(int i = 0; i < N; i++) {
    cout << ans[i] << endl;
  }
}