#include <bits/stdc++.h>

using namespace std;

const int maxn = 2005;

int n;
int a[maxn][maxn];
char buf[maxn];

inline void solve(){
	for (int i = 0; i < n; ++i) {
		scanf("%s", buf);
		for (int j = 0; j < n; ++j) a[i][j] = (buf[j] - '0');
	}
	
	vector<int> ans;
	ans.push_back(0), ans.push_back(1);
	
	for (int i = 2; i < n; ++i) {
		int pos = -1;
		for (int j = 0; j + 1 < ans.size(); ++j) if(a[ans[j]][ans[j + 1]])
			pos = max(pos, j);
		if(!~pos){
			ans.insert(ans.begin(), i);
			continue;
		}
		++pos;
		if(pos + 1 >= ans.size()){
			ans.push_back(i);
			continue;
		}
		int v = ans[pos];
		if(a[v][i]) ans.insert(ans.begin() + pos + 1, i);
		else ans.insert(ans.begin() + pos, i);
	}
	// for (auto u: ans) printf("%d ", u + 1); puts("");
	if(a[ans.back()][ans[0]]){
		ans.insert(ans.begin(), ans.back());
		ans.pop_back();
	}
	for (auto u: ans) printf("%d ", u + 1); puts("");
	return;
}

int main(){
	while(~scanf("%d", &n)) solve();
	return 0;
}