#include <bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops") 
#define pb push_back
#define F first
#define S second
#define sz(a) (int)a.size()
#define pii pair<int,int> 
#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 all(a) a.begin(),a.end() 
#define ld long double

using namespace std ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn =5e6 + 10 , mod = 998244353 , inf= 1e9;;

int e[maxn] , dp[maxn] ,ans[30] ; 

signed main(){
    ios::sync_with_stdio(0);cin.tie(0);
	int n ;
	cin >> n ; 
	rep(i , 0 ,n-1){
		rep(j ,0 ,n-1){
			char f;
			cin >> f; 
			if(f=='1')
			e[i] += (1<<j) ;
		}
	}
	dp[1] = 1; 
	rep(i , 1 , (1<<n)-1){
		if(i%2==0)continue ; 
		rep(j , 0 ,n-1){
			if(i>>j&1)continue ; 
			if((dp[i]&e[j])!=0){
				dp[i+(1<<j)] |= (1<<j) ; 
			}			
		}
	}
	rep(i , 0 , (1<<n)-1){
		if(i%2==1)continue ; 
		int a = (i|1) , b = ((((1<<n)-1)^i)|1); 
		rep(j ,0 , n-1){
			if(dp[a]>>j&1){
				ans[j] |= dp[b];  
			}	
		}
	}
	rep(i ,0 , n-1){
		rep(j ,0 ,n-1){
			int x = (ans[i]>>j&1) ;
			cout << x ;
		}
		cout <<"\n"; 
	}
}
/*

*/