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

#pragma GCC optimize("O3")

#define pb push_back
#define eb emplace_back
#define mp make_pair

using ii = pair<int, int>;

int n, s[24], ord[1 << 24], dp[2][2705000][24];
char ch;

int ls(int x) {
	return x & -x;
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> ch;
			if (ch == '1') {
				s[i] |= (1 << j);
			}
		}
	}
	for (int i = 0; i < n; i++) {
		dp[n & 1][0][i] = 1 << i;
	}
	for (int len = n - 1; len >= 1; len--) {
		int bm = (1 << len) - 1;
		int limit = (1 << n);
		int cnt = 0;
		while (bm < limit) {
			ord[bm] = cnt++;
			for (int tmp = bm; tmp; tmp -= ls(tmp)) {
				int i = 31 - __builtin_clz(ls(tmp));
				dp[len & 1][ord[bm]][i] = 0;
				for (int tmp2 = (((1 << n) - 1) ^ bm) & s[i]; tmp2; tmp2 -= ls(tmp2)) {
					int j = 31 - __builtin_clz(ls(tmp2));
					dp[len & 1][ord[bm]][i] |= dp[(len & 1) ^ 1][ord[bm | ls(tmp2)]][j];
				}
			}
			// Gosper's hack:
			int c = ls(bm);
			int r = bm + c;
			bm = (((r ^ bm) >> 2) / c) | r;
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (dp[1][i][i] & (1 << j)) {
				cout << '1';
			} else {
				cout << '0';
			}
		}
		cout << '\n';
	}
	cout << '\n';
}