// The 1st Universal Cup
// Problem Graph Problem With Small $n$
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize(2)

#include <bits/stdc++.h>

using LL = long long;
using ULL = unsigned LL;

constexpr ULL E(long double x, int y) {
    while (y--) x *= 10;
    return x;
}
constexpr ULL SIZE(long double x, int y) {return E(x, y) + 5;}

const int inf32 = E(1, 9) + 5;
const LL inf64 = E(1, 18) + 5;

int n, all;
char str[105];
int dp[1 << 24];
int graph[25], tag[1 << 24];

int main() {
    scanf("%d", &n);
    all = (1 << n) - 1;
    for (int i = 0; i < n; i++) {
        scanf("%s", str);
        for (int j = 0; j < n; j++)
            if (str[j] == '1')
                graph[i] |= 1 << j;
    }
    for (int mask = 0; mask <= all; mask++) {
        for (int i = 0; i < n; i++) {
            if (!(mask >> i & 1)) continue;
            tag[mask] |= graph[i];
        }
    }
    dp[1] = 1;
    for (int mask = 1; mask <= all; mask++) {
        for (int v = 1; v <= all; v <<= 1) {
            if (mask & v) continue;
            if (!(tag[dp[mask]] & v)) continue;
            dp[mask | v] |= v;
        }
    }
    for (int i = 0; i < n; i++) {
        int ans = 0;
        for (int j = 0; j << 1 < all; j++) {
            if (dp[j << 1 | 1] >> i & 1)
                ans |= dp[all ^ j << 1];
        }
        for (int j = 0; j < n; j++) putchar('0' + (ans >> j & 1));
        putchar('\n');
    }
    return 0;
}