#include <bits/stdc++.h>
using namespace std;
const int maxn = 25, maxS = (1 << 24) + 5;
int n, S, f[maxS], g[maxS], to[maxn], res[maxn];
char a[maxn][maxn];
int main() {
	scanf("%d", &n);
	S = (1 << n) - 1;
	for(int i = 1;i <= n;i++) {
		for(int j = 1;j <= n;j++) cin >> a[i][j], to[i] |= ((a[i][j] - '0') << (j - 1));
		to[i] |= (1 << i - 1);
	}
	f[1] = 1;
	for(int i = 0;i <= S;i++) for(int j = 1;j <= n;j++) if((i >> (j - 1)) & 1 ^ 1) g[i | (1 << j - 1)] |= to[j];
	for(int i = 1;i <= S;i++){
		if(!f[i]) continue;
		for(int j = 1;j <= n;j++) if(((1 << j - 1) & g[f[i]]) && (!(1 << j - 1) & i)) f[i | (1 << j - 1)] |= (1 << j - 1);
	}
	for(int i = 1;i <= S;i+=2) for(int j = 1;j <= n;j++) if((f[i] >> (j - 1)) & 1) res[j] |= f[S - i + 1];
	for(int i = 1;i <= n;i++) {
		for(int j = 1;j <= n;j++) printf(((res[i] >> (j - 1)) & 1) ? "1" : "0");
		puts("");
	}
}