using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Globalization;
using System.Diagnostics;
using static System.Console;
using Pair = System.Collections.Generic.KeyValuePair<int, int>;
//using System.Numerics;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    Scanner cin = new Scanner();
    Random rnd = new Random();
    Stopwatch sw = new Stopwatch();
    readonly int[] dd = { 0, 1, 0, -1, 0 };
    readonly int mod = 1000000007;
    readonly string alfa = "abcdefghijklmnopqrstuvwxyz";
    readonly string ALFA = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";

    int N;
    void solve()
    {
        N = cin.nextint;
        var S = new string[N];
        for (int i = 0; i < N; i++)
        {
            S[i] = cin.next;
        }
        Array.Sort(S);
        var L = new int[N][];//i番目の文字はj番目の文字と何文字一致しているか。
        for (int i = 0; i < N; i++)
        {
            L[i] = new int[N];
        }
        for (int i = 0; i < N; i++)
        {
            for (int j = i + 1; j < N; j++)
            {
                int cnt = 0;
                for (int k = 0; k < Math.Min(S[i].Length, S[j].Length); k++)
                {
                    if (S[i][k] == S[j][k])
                    {
                        cnt++;
                    }
                    else break;
                }
                L[i][j] = cnt + 1;
                L[j][i] = cnt + 1;
            }
        }
        var ans = new long[N];
        for (int i = 1; i < 1 << N; i++)
        {
            var H = new HashSet<int>();
            int cnt = -1;
            long sum = 0;
            for (int j = 0; j < N; j++)
            {
                if ((i >> j & 1) == 1)
                {
                    H.Add(j);
                    int max = 1;
                    int k = j;
                    while (k > 0)
                    {
                        k--;
                        if (!H.Contains(k))
                        {
                            max = Math.Max(max, L[j][k]);
                            break;
                        }
                    }
                    k = j;
                    while(k < N - 1)
                    {
                        k++;
                        if (!H.Contains(k))
                        {
                            max = Math.Max(max, L[j][k]);
                            break;
                        }
                    }
                    sum += max;
                    cnt++;
                }              
            }
            ans[cnt] += sum;
        }
        var E = new long[21];
        E[0] = 1;
        for (int i = 1; i <= 20; i++)
        {
            E[i] = E[i - 1] * i;
            E[i] %= mod;
        }
        for (int i = 0; i < N; i++)
        {
            WriteLine(ans[i] % mod * E[i + 1] % mod);
        }

    }

}

class Scanner
{
    string[] s; int i;
    char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan { get { return ReadLine().Split(); } }
    public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
    public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
    public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint { get { return int.Parse(next); } }
    public long nextlong { get { return long.Parse(next); } }
    public double nextdouble { get { return double.Parse(next); } }
}