#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cassert>
using namespace std;

namespace solve
{
    const int maxn = 24;

    int f[1 << maxn];
    int n;
    int adj[maxn];
    int g[1 << maxn];

    void main()
    {
        cin >> n;
        for (int i = 0; i < n; i++)
        {
            static char str[maxn];
            cin >> str;
            for (int j = 0; j < n; j++)
                if (str[j] == '1')
                    adj[i] |= 1 << j;
        }
        f[1] = 1;
        for (int S = 0; S < 1 << n; S++)
            if (f[S])
                for (int i = 1; i < n; i++)
                    if (!(S >> i & 1))
                        if (adj[i] & f[S])
                            f[S | (1 << i)] |= 1 << i;
        int all = (1 << n) - 1;
        for (int S = 0; S < 1 << n; S++)
            if (f[S])
            {
                assert(S & 1);
                int T = all ^ S;
                T++;
                for (int i = 0; i < n; i++)
                    if (f[S] >> i & 1)
                        g[i] |= f[T];
            }
        for (int i = 0; i < n; i++, cout << endl)
            for (int j = 0; j < n; j++)
                if (g[i] >> j & 1)
                    cout << 1;
                else
                    cout << 0;
    }
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    int T = 1;
    // cin >> T;
    while (T--)
        solve::main();
}