#include <bits/stdc++.h>
using namespace std;

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef complex<double> cpx;
template <typename T> using minPq = priority_queue<T, vector<T>, greater<T>>;
#define ms(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define fs first
#define sn second
#define ALL(v) begin(v), end(v)
#define SZ(v) ((int) (v).size())
#define lbv(v, x) (lower_bound(ALL(v), x) - (v).begin())
#define ubv(v, x) (upper_bound(ALL(v), x) - (v).begin())
template <typename T> inline void UNIQUE(vector<T> &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) {cerr << #x << ' ' << x << endl;}
#define dbgArr(arr, n) {cerr << #arr; FR(_i, n) cerr << ' ' << (arr)[_i]; cerr << endl;}
template <typename T, typename U>
ostream& operator<<(ostream &os, pair<T, U> p){return os << "(" << p.fs << ", " << p.sn << ")";}

mt19937 rng(438954192);
const int MN = 24;
int n, mask;
int adjMat[MN], iAdjMat[MN], ans[MN];
int dp[1<<(MN-1)], hasDp[1<<(MN-1)];
vi smallPop, eqPop;

bool tmpAns[MN];

bool dfs(int s1, int n1){
    if(hasDp[s1] & (1 << n1)) return dp[s1] & (1 << n1);
    hasDp[s1] |= 1 << n1;

    int adj = adjMat[n1] & s1;
    while(adj){
        int n2 = __builtin_ctz(adj);
        adj ^= 1 << n2;
        if(dfs(s1 ^ (1 << n2), n2)){
            dp[s1] |= 1 << n1;
            return true;
        }
    }
    return false;
}

void solve(){
    dp[0] = adjMat[n-1];
    for(int s1 : smallPop){
        int inc = ~s1 & dp[s1];
        #define proc(n1){int flag = (inc >> n1) & 1; dp[s1 | (1 << n1)] |= adjMat[n1] & -flag;}
        FR(n1, n-1) proc(n1);
        hasDp[s1] = mask;
    }
    for(int s1 : eqPop) hasDp[s1] = mask;

    FR(src, n-1) tmpAns[src] = dfs(mask ^ (1 << src), src);
}

int main(){
    cin.sync_with_stdio(0); cin.tie(0);
    cin >> n;
    FR(i, n){
        string str; cin >> str;
        FR(j, n) iAdjMat[i] |= (str[j]-'0') << j;
    }
    FR(s, 1<<(n-1)){
        int pop = __builtin_popcount(s);
        if(pop < 10) smallPop.pb(s);
        if(pop == 10) eqPop.pb(s);
    }
    mask = (1<<(n-1))-1;

    FR(src, n){
        fill_n(dp, 1<<(n-1), 0);
        fill_n(hasDp, 1<<(n-1), 0);
        vi ord(n);
        iota(ALL(ord), 0);
        shuffle(ALL(ord), rng);
        if(ord[n-1] != src) swap(ord[n-1], *find(ALL(ord), src));
        ms(adjMat, 0);
        FR(i, n) FR(j, n) adjMat[i] |= ((iAdjMat[ord[i]] >> ord[j]) & 1) << j;
        solve();
        FR(i, n) ans[src] |= tmpAns[i] << ord[i];
    }

    FR(i, n){
        FR(j, n) cout << ((ans[i] >> j) & 1);
        cout << '\n';
    }
}