#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];
      }
    }
  }

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

    for (int mask = 1; mask < (1 << n); ++mask) {
      int possible_last = dp[mask];
      int possible_next = adj[possible_last] & (~mask);
      for (int next = 0; next < n; ++next) {
        if (possible_next >> next & 1) {
          dp[mask ^ (1 << next)] |= 1 << next;
        }
      }
    }

    for (int end = 0; end < n; ++end) {
      cout << (dp.back() >> end & 1);
    }
    cout << '\n';
  }

}