// Title:  Hamilton
// Source: QOJ2833
// Author: Jerrywang
#include <bits/stdc++.h>
#define F first
#define S second
#define pii pair<int, int>
#define ll long long
#define rep(i, s, t) for(int i=s; i<=t; ++i)
#define debug(x) cerr<<#x<<":"<<x<<endl;
const int N=2005;
using namespace std;

int n, g[N][N]; vector<int> a;
void ins(int i, int x)
{
    a.insert(a.begin()+i, x);
}
bool getans(int val)
{
    a.clear();
    rep(i, 1, n)
    {
        bool f=0;
        rep(j, i+1, n) if(g[i][j]==val)
        {
            a.push_back(i), a.push_back(j), f=1; break;
        }
        if(f) break;
    }
    if(a.empty()) return 0;
    rep(i, 1, n)
    {
        int k=-1;
        for(int x:a) if(x==i) k=1;
        if(k==1) continue;
        rep(j, 1, a.size()-2)
        {
            if(g[a[j-1]][a[j]]==val && g[a[j]][a[j+1]]!=val)
            {
                k=j; break;
            }
        }
        if(k==-1) a.push_back(i);
        else if(g[a[k]][i]==val) ins(k+1, i);
        else ins(k, i);
    }
    if(g[a[n-1]][a[0]]==val)
        a.insert(a.begin(), a[n-1]), a.pop_back();
    vector<int> c(n);
    rep(i, 0, a.size()-1) c[i]=(g[a[i]][a[(i+1)%n]]);
    int cnt=0;
    rep(i, 0, n-2) cnt+=(c[i]!=c[i+1]);
    if(cnt>1) return 0;
    for(int x:a) printf("%d ", x);
    puts(""); return 1;
}
void solve()
{
    rep(i, 1, n) rep(j, 1, n) scanf("%1d", &g[i][j]);
    if(!getans(0)) getans(1);
}
int main()
{
    #ifdef Jerrywang
    freopen("E:/OI/in.txt", "r", stdin);
    #endif
    while(~scanf("%d", &n)) solve();
    
    return 0;
}