#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], dp[1 << 24], good[1 << 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);
			}
		}
	}
	dp[0] = (1 << (n - 1));
	for (int bm = 1; bm < (1 << (n - 1)); bm++) {
		for (int tmp = bm; tmp; tmp -= ls(tmp)) {
			int pos = __builtin_ctz(tmp);
			if (dp[bm ^ (1 << pos)] & s[pos]) {
				dp[bm] |= (1 << pos);
			}
		}
	}
	for (int u = 0; u < n - 1; u++) {
		for (int msk = 1; msk < (1 << (n - 1)); msk++) {
			if (!(msk & (1 << u)) || !(dp[msk] & (1 << u))) {
				continue;
			}
			good[msk] |= (1 << u);
		}
	}
	for (int u = 0; u < n - 1; u++) {
		int cur = 0;
		for (int msk = 1; msk < (1 << (n - 1)); msk++) {
			if (!(msk & (1 << u)) || !(dp[msk] & (1 << u))) {
				continue;
			}
			int inv = ((1 << (n - 1)) - 1) ^ msk;
			cur |= good[inv];
		}
		for (int v = 0; v < n - 1; v++) {
			cout << !!(cur & (1 << v));
		}
		cout << !!(dp[(1 << (n - 1)) - 1] & (1 << u)) << '\n';
	}
	for (int i = 0; i < n; i++) {
		cout << !!(dp[(1 << (n - 1)) - 1] & (1 << i));
	}
	cout << '\n';
}