// 君の人生は月明かりだ、有りがちだなんて言わせるものか
// Think twice, code once.
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;

int n, a[2005][2005], p[2005];

int main() {
	while (scanf("%d", &n) != EOF) {
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++) scanf("%1d", &a[i][j]);
		p[1] = 1;
		for (int i = 1; i < n; i++) {
			int b = 0;
			for (int j = 1; j <= i; j++)
				if (a[p[j]][p[j % i + 1]] != a[p[j % i + 1]][p[(j % i + 1) % i + 1]]) {b = j % i + 1; break;}
			p[i + 1] = i + 1;
			// if (i == 3) eprintf("%d\n", b);
			// eprintf("%d %d\n", a[p[1]][p[2]], a[p[2]][p[1]]);
			if (!b) {
				if (a[p[i]][p[i + 1]] == a[p[i - 1]][p[i]] || a[p[i]][p[i + 1]] == a[p[i + 1]][p[1]])
					continue;
				for (int j = i; j >= 1; j--) swap(p[j], p[j + 1]);
				continue;
			}
			if (a[p[b]][i + 1] == a[p[b]][p[b % i + 1]])
				for (int j = i; j >= b; j--) swap(p[j], p[j + 1]);
			else for (int j = i; j > b; j--) swap(p[j], p[j + 1]);
		}
		for (int i = 1; i <= n; i++) printf("%d ", p[i]);
		puts("");
	}
	return 0;
}