#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int MAXN = 24;
int n, dp[1LL << MAXN], adj[MAXN], ans[MAXN];
string s[MAXN];
bool istheone = false;

signed main() {
	cin.tie(NULL)->sync_with_stdio(0);
	cin >> n;
	if (n > 20)istheone = true;
	for (int i = 1; i <= n; i++) cin >> s[i];
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < n; j++) {
			if (s[i][j] == '1') adj[i] ^= 1LL << j;
		}
	}
	dp[1] = 1;
	for (int i = 2; i < 1LL << n; i++) {
		vector<int> v;
		for (int j = 0; j < n; j++) {
			if ((1LL << j) & i)v.push_back(j);
		}
		if (v[0] != 0)continue;
		for (int x : v) {
			if (dp[i ^ (1LL << x)] & adj[x + 1]) {
				dp[i] |= 1LL << x;
			}
		}
	}
	if (istheone)return 0;
	for (int c = 1; c <= n; c++) {
		for (int i = 1; i < 1LL << n; i++) {
			vector<int> v;
			for (int j = 0; j < n; j++) {
				if ((1LL << j) & i)v.push_back(j);
			}
			if (v[0] != 0)continue;
			if (!(dp[i] & (1LL << (c - 1))))continue;
			int comp = (((1LL << n) - 1) ^ i) + 1;
			ans[c] |= dp[comp];
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < n; j++) {
			if (ans[i] & (1LL << j)) {
				cout << '1';
			}
			else {
				cout << '0';
			}
		}
		cout << '\n';
	}
}