#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL n, dp[1 << 20], v[20][20], ans[20], f[21], MOD = 1e9 + 7;
string s[20];

int bc(int v) {
	int c = 0;
	while(v) { c += v % 2; v /= 2; }
	return c;
}

int main() {
	cin >> n;
	inc(i, n) { cin >> s[i]; }
	
	inc(i, n) { s[i] += "@"; }
	inc(i, n) {
	inc(j, n) {
		int k = 0;
		while(s[i][k] != '@' && s[i][k] == s[j][k]) { k++; }
		v[i][j] = k + 1;
	}
	}
	
	f[0] = 1;
	inc1(i, 20) { f[i] = f[i - 1] * i % MOD; }
	
	inc(b, 1 << n) {
	inc(i, n) {
		if((b >> i) & 1) { continue; }
		
		LL ma = 1;
		inc(j, n) {
			if((b >> j) & 1) { continue; }
			if(j == i) { continue; }
			setmax(ma, v[i][j]);
		}
		(dp[b | (1 << i)] += dp[b] + ma * f[bc(b)]) %= MOD;
	}
	}
	
	incID(b, 1, 1 << n) { (ans[bc(b) - 1] += dp[b]) %= MOD; }
	inc(i, n) { cout << ans[i] << "\n"; }
	
	return 0;
}