#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;

const int MAXN = 25;

int n, e[MAXN];
int f[1 << MAXN];
int nx[1 << MAXN];
int nd[1 << MAXN];
int ans[MAXN];

char str[MAXN];
inline void read(int t) {
	scanf ("%s", str);
	for (int i = 0; i < n; ++ i)
		if (str[i] == '1')
			e[t] |= (1 << i);
}
queue<int>q;
inline void DP() {
	f[1] = 1; q.push(1); 
	nx[1] = e[1];
	while (!q.empty()) {
		int u = q.front(); q.pop();
		int nxt = nx[u] & ((1 << n) - u - 1);
		for (int i = 1; i <= n; ++ i)
			if ((1 << (i - 1)) & nxt) {
				int v = u | (1 << (i - 1));
				if (!f[v]) f[v] = 1, q.push(v);
				nx[v] |= e[i]; nd[v] |= (1 << (i - 1));
			}
	}
}
inline void Solve() {
	ans[1] = nd[(1 << n) - 1]; putchar('0');
	for (int i = 2; i <= n; ++ i)
		if ((ans[1] >> (i - 1)) & 1)
			ans[i] = 1, putchar('1');
		else putchar('0');
	puts("");
	for (int i = 2; i <= n; ++ i) {
		for (int j = 1; j < (1 << n); ++ j)
			if (f[j] && (j & (1 << (i - 1))))
				if ((j & 1) && (nd[j] & (1 << (i - 1))))
					ans[i] |= nd[(1 << n) - j];
		for (int j = 1; j <= n; ++ j) {
			if (i == j) putchar('0');
			else printf ("%d", (ans[i] >> (j - 1)) & 1);
		}
		puts("");
	}
}

int main()
{
	scanf ("%d", &n);
	for (int i = 1; i <= n; ++ i)
		read(i);
	DP(); Solve();
	return 0;
}