#include "bits/stdc++.h"
#define rep(i, a, n) for (auto i = a; i <= (n); ++i)
#define revrep(i, a, n) for (auto i = n; i >= (a); --i)
#define all(a) a.begin(), a.end()
#define sz(a) (int)(a).size()
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; }
using namespace std;

void debug_out() { cerr << endl; }
template<class H, class... T> void debug_out(H h, T... t) {
	cerr << " " << to_string(h);
	debug_out(t...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: "; debug_out(__VA_ARGS__)

using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;


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

	int n;
	while (cin >> n) {
		vector<string> ss(n);
		for (auto &s: ss) cin >> s;
		vi vec{0, 1};
		rep(v, 2, n - 1) {
			int found = -1;
			rep(i, 0, sz(vec) - 1) {
				int a = vec[(i - 1 + sz(vec)) % sz(vec)];
				int b = vec[i];
				int c = vec[(i + 1) % sz(vec)];
				if (ss[a][b] == '0' && ss[b][c] == '1') {
					found = i;
					break;
				}
			}
			if (found == -1) vec.insert(vec.begin(), v);
			else {
				int a = vec[found];
				if (ss[v][a] == 0) vec.insert(vec.begin() + found + 1, v);
				else vec.insert(vec.begin() + found, v);
			}
		}
		int found = -1;
		rep(i, 0, sz(vec) - 1) {
			int a = vec[(i - 1 + sz(vec)) % sz(vec)];
			int b = vec[i];
			int c = vec[(i + 1) % sz(vec)];
			if (ss[a][b] == '0' && ss[b][c] == '1') {
				found = i;
				break;
			}
		}
		if (found != -1) rotate(vec.begin(), vec.begin() + found, vec.end());
		for (auto x: vec) printf("%d ", x + 1);
		puts("");
	}
	return 0;
}