#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

void Main() {
  int n;
  cin >> n;
  string s[n];
  rep(i,n) {
    cin >> s[i];
    s[i]+='*';
  }
  ll d[n][n];
  mem(d);
  rep(i,n) {
    REP(j,i+1,n) {
      rep(k,min(s[i].size(),s[j].size())) {
        d[i][j]++;d[j][i]++;
        if(s[i][k]!=s[j][k]) break;
      }
    }
  }
  ll dp[1<<n],c[1<<n];
  mem(dp);mem(c);
  c[0]=1;
  rep(t,1<<n) {
    rep(i,n) {
      if(t&(1<<i)) continue;
      ll M=1;
      rep(j,n) {
        if(t&(1<<j)) continue;
        M=max(M,d[i][j]);
      }
      dp[t|(1<<i)]+=dp[t]+M*c[t];
      dp[t|(1<<i)]%=MAX;
      c[t|(1<<i)]+=c[t];
      c[t|(1<<i)]%=MAX;
    }
  }
  ll ans[n+1];
  mem(ans);
  rep(t,1<<n) {
    int k=__builtin_popcount(t);
    ans[k]+=dp[t];
    ans[k]%=MAX;
  }
  REP(i,1,n+1) pr(ans[i]);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}