#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
const int N = 5005;
int n, m;
int e[N][N];
int main() {
#ifdef zqj
	freopen("$.in", "r", stdin);
#endif
	std::ios::sync_with_stdio(false), cin.tie(0);
	for(;cin >> n;) {
		std::vector<int> w, b;
		std::mt19937 gen(12400);
		for(int i = 1;i <= n;++i) {
			for(int j = 1;j <= n;++j) {
				char c; cin >> c;
				e[i][j] = c & 1;
			}
		}
		for(int i = 1;i <= n;++i) {
			for(;w.size();) {
				if(b.size() && e[w.back()][b.back()] == 1) {
					b.push_back(w.back());
					w.pop_back();
				} else {
					break;
				}
			}
			if(w.empty()) {
				w.push_back(i);
			} else if(b.empty()) {
				b.push_back(i);
			} else {
				if(e[b.back()][i] == 1) {
					b.push_back(i);
				} else {
					w.push_back(b.back());
					w.push_back(i);
					b.pop_back();
				}
			}
			for(int i = 1;i < (int) w.size();++i) {
				assert(e[w[i - 1]][w[i]] == 0);
			}
			for(int i = 1;i < (int) b.size();++i) {
				assert(e[b[i - 1]][b[i]] == 1);
			}
		}
		for(int x : w) {
			cout << x << ' ';
		}
		for(int x : b) {
			cout << x << ' ';
		}
		cout << '\n';
	}
}