#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int n,p[2005],cur;
char mp[2005][2005];
int c(int i){return i==cur?mp[p[cur]][p[1]]:mp[p[i]][p[i+1]];}
int nxt(int i){return i==cur?1:i+1;}
void ins(int x,int y)
{
    for(int i=cur+1;i>x;--i)p[i]=p[i-1];
    p[x]=y;
}
int main()
{
    while(~scanf("%d",&n))
    {
        for(int i=1;i<=n;++i)scanf("%s",mp[i]+1);
        for(int i=1;i<=n;++i)for(int j=1;j<=n;++j)mp[i][j]-='0';
        p[1]=1,p[2]=2;
        for(int i=3;i<=n;++i)
        {
            cur=i-1;
            int pos=0;
            for(int j=1;j+1<i;++j)
                if(c(j)!=c(nxt(j)))
                    assert(!pos),pos=j;
            // cerr<<pos<<'\n';
            // cerr<<c(1)<<' '<<c(2)<<'\n';
            if(!pos)
            {
                p[i]=i,cur=i;
                for(int j=1;j<i;++j)
                    if(c(j)!=c(nxt(j)))
                    {
                        rotate(p+1,p+j+1,p+i+1);
                        break;
                    }
            }
            else
            {
                if(mp[p[pos]][i]==mp[p[nxt(pos)]][i])
                    ins(pos+1,i);
                else if(mp[p[nxt(pos)]][i]==mp[p[nxt(nxt(pos))]][i])
                    ins(pos+2,i);
                else if(mp[p[nxt(pos)]][i]==c(pos))
                    ins(pos+2,i);
                else ins(pos+1,i);
            }
        }
        for(int i=1;i<=n;++i)printf("%d ",p[i]);
        puts("");
    }
}