#include <iostream>
#include <fstream>
#include <cassert>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#include <time.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<28;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

vl fact(30);

ll Fact(ll n){
	if(fact[n]) return fact[n];
	if(!n) return fact[n]=1;
	return fact[n]=Fact(n-1)*n%mod;
}

int n;
vs a;

int main(){
	cin>>n;
	a=vs(n);
	int sum=0;
	for(int i=0;i<n;i++){
		cin>>a[i];
		sum+=a[i].size();
		a[i]+='!';
	}
	assert(1<=n&&n<=20);
	assert(1<=sum&&sum<=1000);
	for(int i=0;i<n;i++) for(int j=0;j<n;j++) if(i!=j) assert(a[i]!=a[j]);
	for(int i=0;i<n;i++){
		for(int j=0;j<a[i].size()-1;j++){
			int c=a[i][j]-'a';
			assert(0<=c&&c<=25);
		}
	}
	sort(a.begin(),a.end());
	vl dp(1<<n),res(n);
	vvl b(n,vl(n));
	for(int i=0;i<n;i++) for(int j=0;j<n;j++) if(i!=j){
		int t=1;
		while(a[i][t-1]==a[j][t-1]) t++;
		b[i][j]=t;
	}
	for(int i=1;i<1<<n;i++){
		ll num=-1,p=-1;
		vl c(n,1);
		int I=0;
		for(int j=0;j<n;j++){
			if(i&1<<j){
				num++;
				if(p!=-1) c[j]=b[j][p];
			}
			else{
				p=j;
				while(I<p){
					if(i&1<<I) c[I]=max(c[I],b[I][p]);
					I++;
				}
			}
		}
		for(int j=0;j<n;j++) if(i&1<<j){
			(dp[i]+=c[j]*Fact(num)+dp[i-(1<<j)])%=mod;
		}
		(res[num]+=dp[i])%=mod;
	}
	for(int i=0;i<n;i++) cout<<res[i]<<endl;
}