#include<bits/stdc++.h>
using namespace std;
#define int long long
int n;
int a[305];
const int mod=1e9+7;
int s[305][305];
int qkp(int b,int p){
    int r=1;
    while(p){
        if(p&1)(r*=b)%=mod;
        p/=2;
        (b*=b)%=mod;
    }
    return r;
}
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[j][i]=t[j-1]-'0';
    }
    for(int i=1;i<=n;i++)cin>>s[i][n+1],s[i][n+1]=mod-s[i][n+1];
    for(int i=1;i<=n;i++){
        int p=i;
        for(int j=1;j<=n;j++){
            if(j<i&&s[j][j])continue;
            if(s[j][i]>s[p][i])p=j;
        }
        for(int j=1;j<=n+1;j++)swap(s[i][j],s[p][j]);
        if(!s[i][i])continue;
        for(int j=1;j<=n;j++){
            if(j!=i){
                int f=s[j][i]*qkp(s[i][i],mod-2)%mod;
                for(int k=1;k<=n+1;k++)s[j][k]-=f*s[i][k]%mod,s[j][k]+=mod,s[j][k]%=mod;
            }
        }
    }
    for(int i=1;i<=n;i++)cout<<s[i][n+1]*qkp(s[i][i],mod-2)%mod<<" ";
    //xi
    //x1*s[1][1]+x2*s[2][1]+...=a[1]
    //x1*s[1][2]+x2*s[2][2]+...=a[2]
    return 0;
}