#include <iostream>
#define ll long long
using namespace std;
const ll N = 530;
const ll mod = 2;
ll n; ll Ans = 1;
struct elem {
	ll a, b;
}t[N][N];
ll I[N][N];
bool ZERO = 0; ll Z = 0;
namespace CHARA {
	ll p[N][N], a[N][N];
	ll qpow (ll a, ll b) {
		ll ans = 1ll;
		while (b) {
			if (b & 1) ans = ans * a % mod;
			a = a * a % mod;
			b >>= 1;
		}
		return ans;
	}
	ll inv (ll x) {return qpow (x, mod - 2);}
	void Hesb (ll n) {
		for (register ll i=1;i<n;i++) {
			ll p = -1;
			for (register ll j=i+1;j<=n;j++) {
				if (a[j][i]) {
					p = j;
					break ;
				}
			}
			if (p == -1) continue ;
			else {
				swap (a[p], a[i + 1]);
				for (register ll j=1;j<=n;j++) swap (a[j][p], a[j][i + 1]);
			}
			for (register ll j=i+2;j<=n;j++) {
				ll tmp = a[j][i] * inv (a[i + 1][i]) % mod;
				for (register ll k=1;k<=n;k++) a[j][k] = (a[j][k] + mod - tmp * a[i + 1][k] % mod) % mod;
				for (register ll k=1;k<=n;k++) a[k][i + 1] = (a[k][i + 1] + tmp * a[k][j] % mod) % mod;
			}
		}
	}
	ll neg (ll x) {
		x = mod - x;
		return x % mod;
	}
	void solu () {
		p[0][0] = 1;
		for (register ll i=1;i<=n;i++) {
			for (register ll m=1;m<i;m++) {
				ll tmp = a[m][i];
				for (register ll j=m;j<i;j++) tmp = tmp * a[j + 1][j] % mod;
				for (register ll j=0;j<=n;j++) p[i][j] = (p[i][j] + neg (tmp * p[m - 1][j] % mod)) % mod;
			}
			for (register ll j=1;j<=n;j++) p[i][j] = (p[i][j] + p[i - 1][j - 1]) % mod;
			for (register ll j=0;j<=n;j++) p[i][j] = (p[i][j] + neg (a[i][i] * p[i - 1][j] % mod)) % mod;
		}
	}
}
using namespace CHARA;
void solve (elem t[N][N]) {
	for (ll i=1;i<=n;i++) {
		ll ps = -1;
		if (t[i][i].b) ps = i;
		while (ps == -1) {
			for (ll j=i;j<=n;j++) if (t[i][j].b) {
				ps = j; break ;
			}
			if (ps != -1) break ;
			Z ++;
			if (Z >= n + 1) {
				ZERO = 1;
				return ;
			}
			for (ll j=1;j<=n;j++) t[i][j].b = t[i][j].a, t[i][j].a = 0;
			for (ll j=1;j<i;j++) {
				ll tmp = t[i][j].b * inv (t[j][j].b) % mod;
				for (ll k=1;k<=n;k++) {
					t[i][k].a = (t[i][k].a - t[j][k].a * tmp % mod + mod) % mod;
					t[i][k].b = (t[i][k].b - t[j][k].b * tmp % mod + mod) % mod;
					I[i][k] = (I[i][k] - I[j][k] * tmp % mod + mod) % mod;
				}
			}
		}
		for (ll j=1;j<=n;j++) swap (t[j][i], t[j][ps]);
		for (ll j=1;j<=n;j++) swap (I[j][i], I[j][ps]);
		ll invv = inv (t[i][i].b);
		for (ll k=1;k<=n;k++) {
			t[i][k].a = t[i][k].a * invv % mod;
			t[i][k].b = t[i][k].b * invv % mod;
			I[i][k] = I[i][k] * invv % mod;
		}
		for (ll j=1;j<=n;j++) {
			if (j == i) continue ;
			ll tmp = t[j][i].b * inv (t[i][i].b) % mod;
			for (ll k=1;k<=n;k++) {
				t[j][k].a = (t[j][k].a - t[i][k].a * tmp % mod + mod) % mod;
				t[j][k].b = (t[j][k].b - t[i][k].b * tmp % mod + mod) % mod;
				I[j][k] = (I[j][k] - I[i][k] * tmp % mod + mod) % mod;
			}
		}
	}
}
void Dswap (ll n, ll p, ll q) {
	for (ll i=1;i<=n;i++) swap (I[p][i], I[q][i]);
}
void deter (ll n) {
	bool fu = 0;
	for (ll i=1;i<=n;i++) {
		ll wei = i; bool flag = 0;
		for (ll j=i;j<=n;j++) {
			if (I[j][i] && ! flag) flag = 1;
			if (I[j][i] && I[j][i] < I[wei][i]) wei = j;
		}
		if (! flag) {Ans = 0; return ;}
		if (i != wei) Dswap (n, i, wei), fu = 1 - fu;
		for (ll j=i+1;j<=n;j++) {
			if (I[j][i] > I[i][i]) {Dswap (n, i, j); fu = 1 - fu;}
			while (I[j][i]) {
				long long tmp = I[i][i] * inv (I[j][i]) % mod;
				for (ll k=i;k<=n;k++) I[i][k] = (I[i][k] + (mod - tmp) * I[j][k] % mod) % mod;				
				Dswap (n, i, j);
				fu = 1 - fu;
			}
		}
		Ans = Ans * I[i][i] % mod;
	}
	if (fu) Ans = (- Ans + mod) % mod;
}
int main () {
	cin >> n;
	for (ll i=1;i<=n;i++) I[i][i] = 1;
	for (ll i=1;i<=n;i++) 
		for (ll j=1;j<=n;j++) 
			scanf ("%1lld", &t[i][j].b);
	for (ll i=1;i<=n;i++) 
		for (ll j=1;j<=n;j++) 
			scanf ("%1lld", &t[i][j].a);
	solve (t);
	if (ZERO) {
		for (ll i=0;i<=n;i++) putchar ('0'), putchar (' ');
		return 0;
	}
	for (ll i=1;i<=n;i++) 
		for (ll j=1;j<=n;j++) 
			a[i][j] = mod - t[i][j].a, a[i][j] %= mod;
	Hesb (n);
	solu ();
	deter (n);
	ll Inv = qpow (Ans, mod - 2);
	for (ll i=0;i<=n-Z;i++) printf ("%lld\n", p[n][i + Z] * Inv % mod);
	for (ll i=0;i<Z;i++) putchar ('0'), putchar ('\n');
	return 0;
}