#include <bits/stdc++.h>
#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;
  }
  vc<vi> ans(n, vi(n));
  vc<vi> dp(n, vi(1 << n, 0));
  vi w;
  rep(u, n) {
    rep(i,n) rep(j,1<<n)dp[i][j]=0;
    dp[u][1 << u] = 1;
    rep(i, 1 << n) {
      w.clear();
      rep(j, n) if (!(i >> j & 1)) { w.pb(j); }
      rep(t, n) {
        if (i >> t & 1)
          if (dp[t][i]) {
            for (auto v : w) {
              if (g[t][v]) {
                int s = i | 1 << v;
                dp[v][s] = 1;
              }
            }
          }
      }
    }
    rep(v, n) if (dp[v].back()) ans[u][v] = 1;
  }
  rep(i, n) rep(j, n) { cout << ans[i][j]; if(j+1==n)cout<<"\n";}
}

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