#include <bits/stdc++.h>
#define int long long 
using namespace std;
const int INF=2e3+5;
int n,p3[INF],p[INF];
char c[INF][INF];
void solve() {
	for (int i=1;i<=n;i++)
		for (int j=1;j<=n;j++)
			cin>>c[i][j];
	p[1]=1;p[2]=2;p[3]=3;
	for (int i=4;i<=n;i++) {
		int fl=0;
		for (int j=1;j<i;j++)
			if (c[p[j-1<1?i-1:j-1]][p[j]]!=c[p[j]][p[(j+1>=i)?1:j+1]]) {
				if (c[i][p[j]]==c[p[j]][p[(j+1>=i)?1:j+1]]) {
					p3[0]=0;
					for (int k=1;k<=j;k++) 
						p3[++p3[0]]=p[k];
					p3[++p3[0]]=i;
					for (int k=j+1;k<i;k++) p3[++p3[0]]=p[k];
					for (int i=1;i<=p3[0];i++) p[i]=p3[i];
					fl=1;
					break;
				}
				else {
					p3[0]=0;
					for (int k=1;k<j;k++)
						p3[++p3[0]]=p[k];
					p3[++p3[0]]=i;
					for (int k=j;k<i;k++)
						p3[++p3[0]]=p[k];
					for (int i=1;i<=p3[0];i++) p[i]=p3[i];
					fl=1;
					break;
				}
			}
		if (!fl) p[i]=i;
	}
	int fl2=0;
	for (int j=1;j<=n;j++)
		if (c[p[j-1<1?n:j-1]][p[j]]!=c[p[j]][p[(j+1>n)?1:j+1]]) {
			for (int u=j;u<=n;u++) cout<<p[u]<<" ";
			for (int u=1;u<j;u++) cout<<p[u]<<" ";
			cout<<"\n";
			fl2=1;
			return ;
		}
	if (!fl2) {
		for (int u=1;u<=n;u++)
			cout<<p[u]<<" ";
		cout<<"\n";
	}
	return ;
}
signed main()
{
	ios::sync_with_stdio(false);
	while (cin>>n) solve();
	return 0;
}