#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
bool memBeg;
template<typename T,typename TT> void chkmin(T &x,TT y) {if(x>y) x=y;}
template<typename T,typename TT> void chkmax(T &x,TT y) {if(x<y) x=y;}
constexpr int mod=998244353;
void inc(int &x,int y) {x+=y; x-=(x>=mod)*mod;}
void dec(int &x,int y) {x-=y; x+=(x<0)*mod;}
constexpr int add(int x,int y) {return (x+y>=mod)?x+y-mod:x+y;}
constexpr int sub(int x,int y) {return (x<y)?x-y+mod:x-y;}
constexpr int quick_pow(int x,ll times,int ret=1) {
    for(;times;times>>=1,x=1ll*x*x%mod) if(times&1) ret=1ll*ret*x%mod;
    return ret;
}
constexpr int maxn=2005;
int n,ppre[maxn],pnxt[maxn];
char mat[maxn][maxn];
bool memEn;
void fl() {
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
}
int main() {
    fprintf(stderr,"%.24lf\n",fabs(&memEn-&memBeg)/1024.0/1024.0);
    // fl();
    int tur=0;
    while(~scanf("%d",&n)) {
        for(int i=1;i<=n;i++) scanf("%s",mat[i]+1);
        memset(ppre,0,sizeof(int)*(n+2));
        memset(pnxt,0,sizeof(int)*(n+2));
        int tead=0,rail=n+1;
        pnxt[tead]=1; ppre[rail]=2;
        ppre[1]=tead; pnxt[1]=2;
        ppre[2]=1; pnxt[2]=rail;
        auto emplace=[&](int pos,int idx)->void {
            ppre[idx]=ppre[pos]; pnxt[ppre[pos]]=idx;
            pnxt[idx]=pos; ppre[pos]=idx;
        };
        int dif=-1;
        for(int i=3;i<=n;i++) {
            if(dif==-1) {
                if(mat[pnxt[tead]][pnxt[pnxt[tead]]]==mat[ppre[rail]][i]) {
                    emplace(rail,i);
                    if(mat[ppre[ppre[rail]]][i]!=mat[i][pnxt[tead]]) dif=i;
                } else if(mat[ppre[rail]][i]==mat[i][pnxt[tead]]) {
                    emplace(rail,i); dif=ppre[ppre[rail]];
                } else {
                    emplace(pnxt[tead],i); dif=ppre[rail];
                }
            } else {
                if(mat[ppre[dif]][dif]==mat[dif][i]) {
                    emplace(pnxt[dif],i);
                    if(mat[ppre[i]][i]!=mat[i][pnxt[i]]) {
                        dif=i;
                    } else dif=pnxt[i];
                } else {
                    emplace(dif,i);
                    if(mat[ppre[i]][i]!=mat[i][pnxt[i]]) {
                        dif=i;
                    } else dif=ppre[i];
                }
                if(dif==pnxt[tead]&&mat[dif][pnxt[dif]]==mat[dif][ppre[rail]]) dif=-1;
            }
            // for(int j=pnxt[tead];j!=rail;j=pnxt[j]) printf("%d ",j);
            // puts("");
            // for(int j=pnxt[tead];pnxt[j]!=rail;j=pnxt[j]) printf("%c ",mat[j][pnxt[j]]);
            // printf("%c\n",mat[ppre[rail]][pnxt[tead]]);
            // printf("dif = %d\n",dif);
        }
        for(int i=pnxt[tead];i!=rail;i=pnxt[i]) printf("%d ",i);
        puts("");
    }
    return 0;
}