#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const int mod2 = 1e9+9;
const double eps = 1e-10;

int n;
string s;
vpll h[20];
int L[22][22];
ll ans[20], frac[21];
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  FOR(i, 0, n){
    cin >> s;
    ll h1 = 0, h2 = 0;
    h[i].pb(pll(h1, h2));
    FOR(j, 0, sz(s)){
      int c = s[j] - 'a' + 1;
      h1 = (h1 * 27 + c) % mod;
      h2 = (h2 * 27 + c) % mod2;
      h[i].pb(pll(h1, h2));
    }
  }
  frac[0] = 1;
  FOR(i, 1, 21)frac[i] = frac[i-1] * i % mod;
  FOR(i, 0, n-1)FOR(j, i+1, n){
    int l = 0, r = min(sz(h[i]), sz(h[j]));
    while(r - l > 1){
      int mid = (l + r) / 2;
      if(h[i][mid] == h[j][mid]){
        l = mid;
      }else{
        r = mid;
      }
      L[i+1][j+1] = l;
      L[j+1][i+1] = l;
    }
  }
  FOR(i, 1, (1<<n)){
    int pc = pcnt(i), _i = i * 2;
    ll _s = 0;
    FOR(j, 1, n+1){
      if(((_i>>j)&1)==0)continue;
      int il;
      FORR(k, j-1, 0){
        if(((_i>>k)&1)==0){
          il = k;
          break;
        }
      }
      _s += max(L[j][j+1], L[j][il])+1;
    }
    _s %= mod;
    _s = _s * frac[pc] % mod;
    ans[pc] = (ans[pc] + _s)%mod;
  }
  FOR(i, 1, n+1)cout << ans[i] << endl;
}