#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
#define pii pair<int,int>
#define pip pair<int,pii>
#define pb push_back
#define ll long long
#define debug 
#define maxn 24
#define maxq 100100
#define mod 1'000'000'007
using namespace std;

int n;

int viz[maxn];

int dp[1<<maxn];


inline int get(int mask){

    if(dp[mask]+1)
        return dp[mask];

    if(mask == 1)
        return 1;

    int & ret = dp[mask];
    ret = 0;

    for(int i=1;i<n;i++)
        if(mask & (1<<i))
            if(get(mask xor (1<<i)) & viz[i])
                ret |= (1<<i);
    
    debug("dp[%d] = %d\n",mask,ret);
    return ret;

}

int ans[maxn];

int main(){

    scanf("%d",&n);

    memset(dp,-1,sizeof(dp));

    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++){
            char adj;
            scanf(" %c",&adj);
            if(adj == '1'){
                viz[i] |= (1<<j);
            }
        }

    for(int i=0;i<n;i++)
        for(int mask=1;mask<(1<<n);mask+=2){

            if((get(mask) & (1<<i)))
                ans[i] |= get((1<<n) - 1 - mask + 1);

        }

    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
                if(ans[i] & (1<<j))
                    printf("1");
                else
                    printf("0");
            }
        printf("\n");
    }

        
        
}