#include <bits/stdc++.h>

int main() {
  int n; scanf("%d", &n);
  std::vector<int> e(n);
  for (int i = 0; i < n; i++) {
    std::string s; std::cin >> s;
    for (int j = 0; j < n; j++) if (s[j] == '1')
      e[i] |= 1 << j;
  }
  std::vector<int> c(1 << n);
  for (int i = 0; i < (1 << n); i++)
    for (int j = 0; j < n; j++) if (i & (1 << j))
      c[i] |= e[j];
  std::vector<int> f(1 << n);
  f[1] = 1;
  for (int msk = 0; msk < (1 << n); msk++) if (msk & 1) {
    // printf("%d : %d\n", msk, f[msk]);
    for (int i = 0; i < n; i++) if ((c[f[msk]] & (1 << i)) && !(msk & (1 << i))) {
      f[msk | (1 << i)] |= (1 << i);
    }
  }
  int all = (1 << n) - 1;
  std::vector<int> pl(n);
  for (int msk = 0; msk < (1 << n); msk++) if (msk & 1) {
    int t = (all ^ msk) | 1;
    for (int i = 0; i < n; i++) if (f[msk] & (1 << i))
      pl[i] |= f[t];
  }
  // for (int i = 0; i < n; i++)
    // printf("%d ", pl[i]);
  // printf("\n");
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++)
      printf("%d", (pl[i] >> j) & 1);
    printf("\n");
  }
}