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

#define QwQ3301AwA return 0
#define ll long long

const int N = 305;
const int mod = 1e9 + 7;
int n;
int s[N][N], a[N];
int w[N][N];

int ksm(int a, int b) {
    int ans = 1;
    for (; b; b >>= 1, a = 1ll * a * a % mod) {
        if (b & 1) ans = 1ll * ans * a % mod;
    }
    return ans;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        string t;
        cin >> t;
        for (int j = 1; j <= n; j++) {
            s[i][j] = t[j - 1] - '0';
        }
    }
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            w[i][j] = s[j][i];
        }
        w[i][n + 1] = (mod - a[i]) % mod;
    }
    for (int i = 1; i <= n; i++) {
        int id = i;
        for (int j = i + 1; j <= n; j++) {
            if (w[j][i]) id = j;
        }
        if (id != i) swap(w[i], w[id]);
        int iv = ksm(w[i][i], mod - 2);
        for (int j = 1; j <= n + 1; j++) w[i][j] = 1ll * w[i][j] * iv % mod;
        for (int j = 1; j <= n; j++) {
            if (i == j) continue;
            int xs = w[j][i];
            for (int k = 1; k <= n + 1; k++) {
                w[j][k] = (w[j][k] - 1ll * xs * w[i][k] % mod + mod) % mod;
            }
        }
    }
    for (int i = 1; i <= n; i++) cout << w[i][n + 1] << ' ';
    QwQ3301AwA;
}