#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
#include <experimental/iterator>
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  int n;
  while (cin >> n) {

    vector<string> s(n);
    // for (int i = 0; i < n; i++) {
    //   s[i] = string(n, '0');
    // }
    // for (int i = 0; i < n; i++) {
    //   for (int j = 0; j < i; j++)
    //     if (rand() % 2)
    //       s[i][j] = s[j][i] = '1';
    // }

    for (int i = 0; i < n; i++) {
      cin >> s[i];
    }

    vector<int> p = {0, 1, 2};

    for (int i = 3; i < n; i++) {
      int cnt = 0;
      int pos = 0;
      for (int j = 0; j < i; j++)
        if (s[p[j]][p[(j+1)%i]] != s[p[(j+1)%i]][p[(j+2)%i]]) {
          pos = (j + 1) % i;
          ++cnt;
        }
      assert(cnt <= 2);

      if (s[i][p[pos]] == s[p[pos]][p[(pos + 1) % i]]) {
        p.insert(p.begin() + pos, i);
      } else {
        p.insert(p.begin() + (pos + 1) % i, i);
      }
    }

    {
      int cnt = 0;
      int pos = 0;
      for (int j = 0; j < n; j++)
        if (s[p[j]][p[(j+1)%n]] != s[p[(j+1)%n]][p[(j+2)%n]]) {
          pos = (j + 1) % n;
          ++cnt;
        }
      assert(cnt <= 2);
      rotate(p.begin(), p.begin() + pos, p.end());
    }

    {
      int cnt = 0;
      for (int j = 0; j + 2 < n; j++)
        if (s[p[j]][p[j+1]] != s[p[j+1]][p[j+2]]) {
          ++cnt;
        }
      assert(cnt <= 1);
    }

    for (int i = 0; i < n; i++) {
      cout << p[i] + 1 << (i+1==n ? '\n' : ' ');
    }

  }

  return 0;
}