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

#ifndef ONLINE_JUDGE
#include "debug.cpp"
#else
#define debug(...)
#endif

const int N = 1e4 + 10, MOD = 998244353;


main() {
  ios::sync_with_stdio(0); cin.tie(0);

  int n; cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      char c; cin >> c;
      if (c == '1') {
        a[i] |= 1 << j;
      }
    }
  }

  vector<int> adj(1 << n);
  for (int mask = 1; mask < (1 << n); ++mask) {
    for (int i = 0; i < n; ++i) {
      if (mask >> i & 1) {
        adj[mask] |= a[i];
      }
    }
  }

  int N = (1 << n);
  int dp[N]; // dp[mask][i] = can we end at i with mask, compressed tho
  for (int start = 0; start < n; ++start) {
    memset(dp, 0, sizeof dp);
    dp[1 << start] = 1 << start;

    for (int mask = 1; mask < N; ++mask) {
      int possible_next = adj[dp[mask]] & (~mask);

      while (possible_next > 0) {
        int bit = __builtin_ctz(possible_next);
        possible_next ^= 1 << bit;
        dp[mask ^ (1 << bit)] |= 1 << bit;
      }
    }

    for (int end = 0; end < n; ++end) {
      cout << (dp[N - 1] >> end & 1);
    }
    cout << '\n';
  }

}