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

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	int n;
	cin >> n;
	vector<int> m(n + 1), vis(1 << n), dp(1 << n), ans(n + 1);
	for (int i = 1; i <= n; i++)
	{
		string s;
		cin >> s;
		for (int j = 0; j < s.length(); j++)
		{
			if (s[j] == '1')  m[i] += (1 << j);
		}
	}
	dp[1] = 1;
	queue<int> q;
	q.push(1);
	while (!q.empty())
	{
		int cur = q.front();
		q.pop();
		if (vis[cur])  continue;
		vis[cur] = 1;
		for (int i = 1; i <= n; i++)
		{
			if (!(cur & (1 << (i - 1))) && (dp[cur] & m[i]))
			{
				dp[cur + (1 << (i - 1))] |= (1 << (i - 1));
				if (!vis[cur + (1 << (i - 1))])  q.push(cur + (1 << (i - 1)));
			}
		}
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 0; j < (1 << n); j++)
		{
			if (!(j & (1 << (i - 1))) || !(j & 1) || !(dp[j] & (1 << (i - 1))))  continue;
			ans[i] |= dp[(1 << n) - j];
		}
	}
	for (int i = 1; i <= n; i++)
	{
		int cnt = 0;
		while (ans[i])
		{
			cout << (ans[i] & 1);
			ans[i] >>= 1;
			cnt++;
		}
		for (int j = cnt + 1; j <= n; j++)
		{
			cout << 0;
		}
		cout << '\n';
	}
	return 0;
}