#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

const int MAXN = 2e3 + 100;
vector<int> g[MAXN];
int used[MAXN];

vector<int> path;
int c0, c2;

bool dfs(int v) {
  path.push_back(v);
  used[v] = 1;
  --c0;
  if (c0 == c2) return true;
  for (int u : g[v]) {
    if (!used[u]) {
      if (dfs(u)) return true;
    }
  }
  path.pop_back();
  used[v] = 2;
  ++c2;
  if (c0 == c2) return true;
  return false;
}

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

  int n;
  while (cin >> n) {
    for (int i = 0; i < n; ++i) {
      g[i].clear();
    }
    for (int i = 0; i < n; ++i) {
      string s;
      cin >> s;
      for (int j = 0; j < n; ++j) {
        if (s[j] == '1' && i != j) {
          g[i].push_back(j);
          g[j].push_back(i);
        } 
      }
    }
    fill(used, used + n, 0);
    c0 = n; c2 = 0;
    path.clear();
    for (int i = 0; i < n; ++i) {
      if (!used[i] && dfs(i)) break;
    }
    vector<int> A, B;
    for (int i = 0; i < n; ++i) {
      if (used[i] == 0) {
        A.push_back(i);
      } else if (used[i] == 2) {
        B.push_back(i);
      }
    }
    for (int i = 0; i < (int)A.size(); ++i) {
      path.push_back(A[i]);
      path.push_back(B[i]);
    }
    bool has_last = false;
    for (int u : g[path[0]]) {
      if (u == path.back()) {
        has_last = true;
      }
    }
    if (has_last) {
      vector<int> p;
      p.push_back(path.back());
      for (int i = 0; i < n - 1; ++i) {
        p.push_back(path[i]);
      }
      path = p;
    }
    for (int x : path) {
      cout << x + 1 << " ";
    }
    cout << "\n";
  }

  
  return 0;
}