// what is matter? never mind. 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 2000005
#define inf 0x3f3f3f3f

/*
n^2 2^n / 64
n 2^n
*/

int n;
char s[44];
int e[44];
int f[1<<23],res[33];

signed main()
{
	n=read();
	For(i,0,n-1){
		cin>>s;
		For(j,0,n-1)if(s[j]=='1')e[i]|=(1<<j);
	}
//	For(i,0,n-1)cout<<e[i]<<" ";puts("");
	For(i,0,n-2)
		if(e[n-1]>>i&1) f[1<<i]|=(1<<i);
	int mxs=(1<<(n-1));
	For(s,0,mxs-1){
		int go=0,tmp=f[s];
		while(tmp){
			int i=__builtin_ctz(tmp); tmp^=(1<<i);
			go|=e[i];
		}
		while(go){
			int i=__builtin_ctz(go); go^=(1<<i);
			if(!(s>>i&1))f[s|(1<<i)]|=(1<<i);
		}
	}
//	For(s,0,mxs-1)cout<<f[s]<<" ";puts("");
	For(s,0,mxs-1){
		int t=(mxs-1-s);
		int tmp=f[s];
		while(tmp){
			int i=__builtin_ctz(tmp); tmp^=(1<<i);
			res[i]|=f[t];
		}
	}
	For(i,0,n-1)
		if(f[mxs-1]>>i&1)
			res[n-1]|=(1<<i),res[i]|=(1<<(n-1));
	For(i,0,n-1){
		For(j,0,n-1)cout<<(res[i]>>j&1);
		cout<<"\n";
	}
	return 0;
}