#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// using LL = __int128
#define mod 1000000007ll
ll a[333][333], n;
ll bigmul(ll a, ll b, ll m)
{
	unsigned long long c =
		(unsigned long long)a * b -
		(unsigned long long)((long double)a / m * b + 0.5L) * m;
	return (c + m) % m;
}
ll qpow(ll x, ll y)
{
	ll ans = 1, res = x % mod;
	while (y)
	{
		if (y & 1)
			ans = bigmul(ans, res, mod);
		res = bigmul(res, res, mod);
		y >>= 1;
	}
	return ans;
}
ll inv(ll x)
{
	return qpow(x, mod - 2);
}
void solve()
{
	for (int i = 1; i <= n; i++)
	{
		int p = i;
		for (int j = 1; j <= n; j++)
		{
			if (j < i && a[j][j])
				continue;
			if (a[j][i] > a[p][i])
				p = j;
		}
		for (int j = 1; j <= n + 1; j++)
			swap(a[i][j], a[p][j]);
		if (!a[i][i])
			continue;
		for (int j = 1; j <= n; j++)
			if (j != i)
			{
				ll f = a[j][i] * inv(a[i][i]) % mod;
				for (int k = 1; k <= n + 1; k++)
				{
					a[j][k] = a[j][k] - f * a[i][k] % mod;
					a[j][k] = (a[j][k] % mod + mod) % mod;
				}
			}
	}
	for(int i = 1 ; i <= n ; i++){
		a[i][n + 1] = a[i][n + 1] * inv(a[i][i]) % mod;
		printf("%lld ", a[i][n + 1]);
	}
}
int main()
{
	scanf("%lld", &n);
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			scanf("%1lld", &a[j][i]);
	for (int i = 1; i <= n; i++)
	{
		scanf("%lld", &a[i][n + 1]);
		a[i][n + 1] %= mod;
		a[i][n + 1] = mod - a[i][n + 1];
		a[i][n + 1] %= mod;
	}
	solve();
	return 0;
}