#pragma GCC optimize(2)

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN=24;

int n;
char s[MAXN][MAXN];

int E(int x,int y){return s[x][y] == '1';}

int dp[1<<MAXN],G[MAXN],ret[MAXN];

int main(){
	cin>>n;
	rep(i,0,n-1)cin>>s[i];
	rep(i,0,n-1)rep(j,0,n-1)if(E(i,j))G[i] |= (1<<j);

	dp[1] = 1;
	rep(S,1,(1<<n)-1)if(S&1){
		rep(to,0,n-1)if(!(S>>to&1)){
			if(dp[S] & G[to])dp[S^(1<<to)] |= (1<<to);
		}
	}

	rep(S,1,(1<<n)-1)if(S&1){
		int T=(1<<n)-1;
		T=(T^S)|1;

		rep(u,0,n-1){
			if(dp[S]>>u&1)ret[u] |= dp[T];
			if(dp[T]>>u&1)ret[u] |= dp[S];
		}
	}

	rep(u,0,n-1){
		rep(v,0,n-1)if(ret[u] >> v&1)cout<<"1";else cout<<"0";
		cout<<"\n";
	}

    return 0;
}