#include<bits/stdc++.h>
#define int long long
#define ll long long
#define N ((int)24)
#define int128 __int128
#define INF ((int)2e9 + 2)
#define mod 998244353
#define base 23333
#define base2 19260817
#define db double
#define ldb long double
#define eps 1e-8
#define lowbit(x) (x & -x) 
#define un unsigned
#define rep(i,x,y) for (int i = (x); i <= (y); ++i)
#define drep(i,x,y) for (int i = (x); i >= (y); --i)
#define go(i,u) for (int i = head[u]; i; i = edge[i].next)
#define go_(i,u) for (int i = head[u]; ~i; i = edge[i].next)
#define pii pair<int, int>
#define MP make_pair
#define fir first
#define sec second
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin),p1==p2)?EOF:*p1++)
using namespace std;
//char buf[1<<21],*p1=buf,*p2=buf;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<typename T> inline T rnd(T l,T r) {return uniform_int_distribution<T>(l , r)(rng);}
template<typename T> inline void read (T &t) {
	t = 0; char f = 0, ch = getchar(); long db d = 0.1;
	while (ch > '9' || ch < '0') f |= (ch == '-'), ch = getchar();
	while (ch <= '9' && ch >= '0') t = t * 10 + ch - 48, ch = getchar();
	if (ch == '.') {
		ch = getchar();
		while (ch <= '9' && ch >= '0') t += d * (ch ^ 48), d *= 0.1, ch = getchar();
	}
	t = (f ? -t : t);
}
template <typename T, typename... Args>
	inline void read (T& t, Args&... args) { read(t); read(args...); }
inline void write (int x) {
	if (x >= 10) write(x / 10);
	cout << (int)(x % 10);
}
int n, a[N][N], f[(1 << N) + 2], g[(1 << N) + 2], ans[(1 << N) + 2];
signed main() {
	read(n);
	rep (i, 1, n) rep (j, 1, n) scanf("%1lld", &a[i][j]);
	rep (i, 1, n) rep (j, 1, n) g[i] |= a[i][j] << (j - 1);
	int mx = (1 << n) - 1;
	f[1] = 1;
	rep (S, 1, mx) {
		int sum = 0;
		for (int T = f[S]; T; T -= lowbit(T)) sum |= g[__builtin_ctz(T) + 1];
		sum &= (mx ^ S);
		for (int T = sum; T; T -= lowbit(T)) f[S | lowbit(T)] |= lowbit(T);
		++S;
	}
	rep (S, 1, mx) {
		for (int T = f[S]; T; T -= lowbit(T))
			ans[__builtin_ctz(T) + 1] |= f[(mx ^ S) | 1];
		++S;
	}
	rep (i, 1, n) {
		rep (j, 1, n)
			printf("%lld", (ans[i] >> (j - 1)) & 1);
		printf("\n");
	}
return 0;
}