#include <bits/stdc++.h>
#include <ctime>
#ifndef LOCAL
#define debug(...) 42
#else
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#endif
#define rep1(a) for (int i = 0; i < a; i++)
#define rep2(i, a) for (int i = 0; i < a; i++)
#define rep3(i, a, b) for (int i = a; i < b; i++)
#define rep4(i, a, b, c) for (int i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define pb emplace_back
using namespace std;
template <typename T, typename T2> void cmin(T &x, const T2 &y) {
  x = x < y ? x : y;
}
template <typename T, typename T2> void cmax(T &x, const T2 &y) {
  x = x > y ? x : y;
}
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
template <class T> using vc = vector<T>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
mt19937 rng(time(NULL));
const int inf = 1000000000;
const ll lnf = 1000000000000000000;
#define sz(x) int((x).size())
#define all(x) begin(x), end(x)
#define fi first
#define se second

void solve() {
  int n;
  cin >> n;
  vc<vi> g(n, vi(n));
  rep(i, n) rep(j, n) {
    char c;
    cin >> c;
    if (c == '1')
      g[i][j] = 1;
    else
      g[i][j] = 0;
  }

  int l = n / 2;
  int r = n - l;
  vi p(n);
  iota(all(p), 0);
  vc<vi> ans(n, vi(n));
  while (clock() * 1. / CLOCKS_PER_SEC < 1.95) {
    shuffle(all(p), rng);
    vi ll(p.begin(), p.begin() + l);
    vi rr(p.begin() + l, p.end());
    // debug(ll,rr);
    int full = 0;
    vc<pii> avail;
    vi tmp;
    auto solve = [&](auto &solve, int u, int v, int s) {
      if (s == full) {
        avail.pb(u, v);
        return;
      }
      for (auto x : tmp) {
        if ((!(s >> x & 1)) && g[v][x]) {
          solve(solve, u, x, s | (1 << x));
        }
      }
    };
    full = 0, tmp = ll;
    for (auto x : tmp)
      full |= 1 << x;
    for (auto u : tmp)
      solve(solve, u, u, 1 << u);
    auto a = avail;
    avail.clear();
    full = 0, tmp = rr;
    for (auto x : tmp)
      full |= 1 << x;
    for (auto u : tmp)
      solve(solve, u, u, 1 << u);
    auto b = avail;
    avail.clear();
    // debug(a, b);
    for (auto [x, y] : a) {
      for (auto [z, w] : b) {
        if (g[y][z]) {
          ans[x][w] = ans[w][x] = 1;
        }
      }
    }
  }
  rep(i, n) {
    rep(j, n) cout << ans[i][j];
    cout << "\n";
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}