#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

const int MOD = 1000000007;

int n;
vector<vector<int> > len;
vector<long long> memo;
vector<long long> cnt;

long long solve(bitset<32> bs)
{
    if(memo[bs.to_ulong()] != -1)
        return memo[bs.to_ulong()];

    int m = bs.count();
    long long tmp = 1;
    for(int i=1; i<m; ++i){
        tmp *= i;
        tmp %= MOD;
    }

    long long ans = 0;
    for(int i=0; i<n; ++i){
        if(!bs[i])
            continue;

        int add = 1;
        for(int j=0; j<n; ++j){
            if(!bs[j])
                add = max(add, len[i][j]);
        }
        ans += add * tmp;
        ans %= MOD;

        bs[i] = false;
        ans += solve(bs);
        bs[i] = true;
    }

    cnt[bs.count()] += ans;
    cnt[bs.count()] %= MOD;
    return memo[bs.to_ulong()] = ans;
}

int main()
{
    cin >> n;
    vector<string> s(n);
    for(int i=0; i<n; ++i)
        cin >> s[i];

    len.assign(n, vector<int>(n, 0));
    for(int i=0; i<n; ++i){
        for(int j=0; j<i; ++j){
            int m = min(s[i].size(), s[j].size());
            int k = 0;
            while(k < m && s[i][k] == s[j][k])
                ++ k;
            len[i][j] = len[j][i] = k + 1;
        }
    }

    memo.assign(1<<n, -1);
    cnt.assign(n+1, 0);
    solve((1<<n)-1);

    for(int i=1; i<=n; ++i)
        cout << cnt[i] << endl;

    return 0;
}