#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
using namespace std;
const int N = 2010;
char c[N];
int n;
bool a[N][N];
vector<int> s;
void upd(){
    if(a[s.back()][s[0]]){
        s.insert(s.begin(), s.back());
        s.pop_back();
    }
}

void solve(){
    rep(i, 0, n - 1){
        scanf("%s", c);
        rep(j, 0, n - 1) a[i][j] = c[j] ^ 48;
    }
    s.clear();
    s.push_back(0), s.push_back(1);
    rep(i, 2, n - 1){
        int pos = -1;
        rep(j, 0, i - 2) if(a[s[j]][s[j + 1]]) pos = j;
        if(!~pos){
            s.insert(s.begin(), i);
            upd(); continue;
        }
        if(pos == i - 2){
            s.push_back(i);
            upd(); continue;
        }
        if(a[s[pos + 1]][i]) s.insert(s.begin() + pos + 2, i);
        else s.insert(s.begin() + pos + 1, i);
    }
    for(int &i : s) printf("%d ", i + 1); puts("");
}

int main(){
    while(scanf("%d", &n) != EOF) solve();
    return 0;
}