#include<bits/stdc++.h>
using std::cin;
using std::cout;
using db = double;
using ll = long long;
using u64 = unsigned long long;
const int N = 305;
using set = std::bitset<N>;
set a[N][N];
int deg[N];
int n;
void det() {
	for(int i = 0;i < n;++i) {
		auto get = [&](int j) {
			for(;deg[j] >= 0 && !a[j][i].test(deg[j]);) -- deg[j];
			return deg[j];
		};
		for(int j = i;j < n;++j) {
			deg[j] = n;
		}
		for(int d = n;d >= 0;--d) {
			using pr = std::pair<int, int>;
			static std::vector<pr> v;
			v.clear();
			for(int j = i;j < n;++j) {
				if(get(j) == d) {
					int s = 0;
					for(int k = d;k >= std::max(d - 4, 0);--k) {
						s = s << 1 | a[j][i].test(k);
					}
					v.emplace_back(s, j);
				}
			}
			if(v.empty()) continue;
			for(int z = 0;z + 1 < (int) v.size();++z) {
				int x = v[z].second, y = v[z + 1].second;
				for(int k = i;k < n;++k) {
					a[x][k] ^= a[y][k];
				}
			}
			int z = v.back().second;
			int fnd = -1;
			for(int j = i;j < n;++j) {
				if(j == z) continue;
				int p = get(j);
				if(p != -1 && p != d) {
					fnd = j;
					break;
				}
			}
			if(fnd == -1) {
				if(z != i) {
					for(int j = i;j < n;++j) {
						std::swap(a[i][j], a[z][j]);
					}
				}
				break;
			}
			int shift = d - get(fnd);
			for(int j = i;j < n;++j) {
				a[z][j] ^= a[fnd][j] << shift;
			}
		}
	}
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n;
	std::mt19937 gen;
	for(int k : {1, 0})
	for(int i = 0;i < n;++i) {
		for(int j = 0;j < n;++j) {
			char c;
			cin >> c;
//			c = gen() % 3 ? '1' : 0;
			if(c == '1') {
				a[i][j].set(k);
			}
		}
	}
	det();
	set res; res.set(0);
	for(int i = 0;i < n;++i) {
		set tmp;
		for(int j = 0;j <= n;++j) if(a[i][i].test(j)) tmp ^= res << j;
		res = tmp;
	}
	for(int i = 0;i <= n;++i) {
		cout << res.test(i) << '\n';
	}
}