#include<iostream>
#include<cstdio>
#include<cassert>
#define N 24
#define M 2704156
#define K 12
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int lowbit(int x)
{
    return x&(-x);
}
int n,sz[1<<N],B[N+1],S[1<<N],tong[2][M+1],length[2],dp[2][M+1][K+1],num[1<<N],st[N+1],leng,st2[N+1],leng2;
char c[N+1][N+1];
bool E[N+1][N+1];
int main()
{
    bool op=0;
    n=read();
    for (int i=1;i<(1<<n);++i) sz[i]=sz[i-lowbit(i)]+1;
    for (int i=1;i<=n;++i)
	for (int j=1;j<=n;++j)
	    cin>>c[i][j];
    for (int i=1;i<=n;++i)
	for (int j=1;j<=n;++j)
	    if (c[i][j]=='1')
		B[i]|=(1<<(j-1));
    for (int i=0;i<(1<<n);++i)
	for (int j=1;j<=n;++j)
	    if (i&(1<<(j-1)))
		S[i]|=B[j];
    for (int i=1;i<=n;++i) tong[0][++length[0]]=(1<<(i-1)),num[1<<(i-1)]=length[0],dp[0][num[1<<(i-1)]][1]=(1<<(i-1));
    for (int i=2;i<=((n+1)>>1);++i)
    {
	op^=1,length[op]=0;
	for (int j=0;j<(1<<n);++j)
	    if (sz[j]==i)
	    {
		tong[op][++length[op]]=j,num[j]=length[op],leng=0;
		for (int k=1;k<=sz[j];++k) dp[op][num[j]][k]=0;
		for (int k=1;k<=n;++k)
		    if (j&(1<<(k-1)))
			st[++leng]=k;
		for (int k=1;k<=leng;++k)
		    for (int t=1;t<=leng;++t)
			if (k!=t&&c[st[t]][st[k]]=='1')
			    dp[op][num[j]][k]|=dp[op^1][num[j^(1<<(st[k]-1))]][t-(t>k)];
	    }
    }
    for (int i=0;i<(1<<n);++i)
	if (sz[i]==((n+1)>>1))
	{
	    leng=leng2=0;
	    for (int j=1;j<=n;++j)
	    {
		if (i&(1<<(j-1))) st[++leng]=j;
		else st2[++leng2]=j;
	    }
	    for (int j=1;j<=leng;++j)
		for (int k=1;k<=leng2;++k)
		    if (S[dp[op][num[i]][j]]&dp[op^(n&1)][num[((1<<n)-1)^i]][k])
			E[st[j]][st2[k]]=1;
	}
    for (int i=1;i<=n;++i)
    {
	for (int j=1;j<=n;++j) printf("%d",E[i][j]);
	puts("");
    }
    return 0;
}