#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

const int mod = MOD;
const int max_n = 200005;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
  bool operator==(const mint &p) const { return x == p.x; }
  bool operator!=(const mint &p) const { return x != p.x; }
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
using vm=vector<mint>;
using vvm=vector<vm>;
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
}comb(max_n);

mint P(ll n,ll k){
    return comb.fact[n]*comb.ifact[n-k];
}
mint invP(ll n,ll k){
    return comb.ifact[n]*comb.fact[n-k];
}
vvl g(200010,vl(27,-1));
vvm dp(200010);
vm update(vm v){
    ll n=v.size();
    rep(i,n-1)v[i]+=i;
    v[n-1]+=n-1-1;
    return v;
}
vm mg(vm a,vm b){
    ll n=a.size(),m=b.size();
    vm c(n+m-1);
    rep(i,n){
        rep(j,m){
            c[i+j]+=(a[i]+b[j])*P(n-1,i)*P(m-1,j)*comb(i+j,i);
        }
    }
    rep(i,n+m-1){
        c[i]*=invP(n+m-2,i);
    }
    return c;
}
void dfs(ll v){
    ll cnt=0;
    dp[v]={0};
    rep(i,27){
        if(g[v][i]!=-1){
            cnt++;
            dfs(g[v][i]);
            //update(dp[g[v][i]]);
            dp[v]=mg(dp[v],update(dp[g[v][i]]));
        }
    }
    if(dp[v].size()==1){
        dp[v].emplace_back(1);
        return;
    }

}
int main(){
    ll n;cin >> n;
    ll mx=1;
    rep(i,n){
        string s;cin >> s;s+='{';
        ll now=0;
        rep(i,s.size()){
            ll f=s[i]-'a';
            if(g[now][f]==-1){
                g[now][f]=mx;now=mx;mx++;
            }
            else now=g[now][f];
        }
    }
    dfs(0);
    /*rep(i,mx){
        ll f=dp[i].size()-1;
        rep(j,dp[i].size()){
            cout << dp[i][j]*P(f,j) << " ";
        }
        cout << endl;
    }*/
    repl(i,1,n+1){
        cout << dp[0][i]*P(n,i) << endl;
    }
}