#include <bits/stdc++.h>
//#define int long long
#define ll long long
#define db double
#define fi first
#define se second
#define pii pair<int,int>
#define vi vector<int>

using namespace std;

const int maxn=2e3; 
int n;
int nxt[maxn+5],pre[maxn+5],p[maxn+5],cnt; 
char s[maxn+5][maxn+5]; 
int check(int x,int y,int z,int w) {
	int num=(s[x][y]!=s[y][z])+(s[y][z]!=s[z][w]);
	return num<=1; 
}
int get(int x){
	int y=x%n+1;
	return s[p[x]][p[y]]-'0'; 
}
int CHECK() {
	int num=0; 
	for (int i=1;i<n;i++) {
		if (get(i)!=get(i+1)) num++; 
	}
	return num<=1; 
}
int main() {
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout); 
	while (cin>>n) {
		for (int i=1;i<=n;i++) {
			scanf("%s",s[i]+1); 
			pre[i]=nxt[i]=0; 
		}
		int fir=1,lst=2; 
		nxt[1]=2,pre[2]=1;
		pre[1]=0;nxt[2]=0; 
		for (int i=3;i<=n;i++) {
			if (s[i][fir]=='0') {
				pre[fir]=i; nxt[i]=fir; fir=i; 
			}
			else if (s[i][lst]=='1') {
				nxt[lst]=i; pre[i]=lst; lst=i; 
			}
			else {
				int u=fir,x,y,z; 
				int flag=0; 
				while (u!=0) {
					int nx=nxt[u],nxx=nxt[nx];
					if (nxx){
						if (s[u][nx]!=s[nx][nxx]) {
							flag=1; 
							x=u,y=nx,z=nxx; 
							break ; 
						}
					}
					u=nxt[u];
				}
				if (flag==0) {
					if (s[fir][nxt[fir]]=='0') {
						nxt[lst]=i; pre[i]=lst; lst=i; 
					}
					else {
						pre[fir]=i; nxt[i]=fir; fir=i; 
					}
				}
				else {
					if (check(x,i,y,z)) {
						nxt[x]=i;
						pre[y]=i;
						nxt[i]=y;
						pre[i]=x; 
					}
					else {
						nxt[y]=i;
						pre[z]=i;
						nxt[i]=z;
						pre[i]=y; 
					}
				}
			}
		}
		if (s[lst][fir]=='0') {
			nxt[lst]=fir; 
			fir=lst; 
		}
		int u=fir;
		cnt=0; 
		for (int i=1;i<=n;i++) {
	//		p[++cnt]=u; 
			cout<<u<<' '; 
			u=nxt[u]; 
		}
		cout<<'\n'; 
	//	cerr<<CHECK()<<'\n'; 
	}
	return 0;
}