#pragma GCC optimize("Ofast")
#include <cstdio>
#include <iostream>

namespace IO {
	template<typename T> inline void rd(T& x) {
		x = 0; bool f = 0; char s = getchar();
		while (s < '0' || s > '9') f |= s == '-', s = getchar();
		while ('0' <= s && s <= '9') x = x * 10 + (s - '0'), s = getchar();
		x = f ? -x : x;
	}
	template<typename T, typename ...Args> inline void rd(T& x, Args& ...args) { rd(x), rd(args...); } 
	template<typename T> inline void wt(T x, char s) {
		int stk[114], top = 0;
		if (x < 0) putchar('-'), x = -x;
		do stk[ ++ top] = x % 10, x /= 10; while (x);
		while (top) putchar(stk[top -- ] + '0');
		putchar(s);
	}
}
using namespace IO;
using namespace std;

const int N = 27;
char s[N];
int g[N];
int n, all;
int f[(1 << 24) + 7];
int ans[N];

inline int dp(int s) {
	if (f[s] != -1) return f[s];
	f[s] = 0;
	for (int i = 1; i <= n; ++ i) {
		if (!((s >> (i - 1)) & 1)) continue;
// 		if (s == 7) cerr << i << " " << dp(s ^ (1 << (i - 1))) << " " << g[i] << endl;
		f[s] |= (!!(dp(s ^ (1 << (i - 1))) & g[i])) << (i - 1);
	}
	return f[s];
}

int main() {
	#ifndef ONLINE_JUDGE 
	freopen("in.in", "r", stdin);
	freopen("out.out", "w", stdout);
	#endif
	rd(n), all = (1 << n) - 1;
	for (int i = 1; i <= n; ++ i) {
		scanf("%s", s + 1);
		for (int j = 1; j <= n; ++ j) {
			g[i] += (s[j] - '0') << (j - 1);
		}
	}
	for (int i = 0; i <= all; ++ i) f[i] = -1;
	f[1] = 1;
	dp(all);
	for (int i = 1; i <= n; ++ i) {
		for (int s = 0; s <= all; ++ s) {
			if ((f[s] >> (i - 1)) & 1) ans[i] |= f[all ^ s ^ 1];
		}
	}
	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= n; ++ j) {
			putchar(((ans[i] >> (j - 1)) & 1) + '0');
		}
		putchar('\n');
	}
	return 0;
}