#include <queue>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#define ll long long
using namespace std;
const int N = 505;
int t, n, m, ans;
int in[N], res[N];
char str[N];
void solve(){
    ans = n;
    int flag = 1;
    while(flag){
        flag = 0;
        int iMax = -1;
        for(int i = 1; i <= n; i ++){
            if(iMax < in[i]){
                iMax = in[i];
                flag = 1;
            }
        }
        for(int i = 1; i <= n; i ++){
            if(iMax == in[i]){
                res[ans--] = i;
                in[i] = -2;
            }
        }
    }
}
int main(){
    while(scanf("%d", &n) && n){
        fill(in, in+n+1, 0);
        for(int i = 1; i <= n; i ++){
            scanf("%s", str+1);
            for(int j = 1; j <= n; j ++){
                t = str[j]-‘0‘;
                if(t){
                    in[j] ++;
                }
            }
        }
        solve();
        for(int i = 1; i < n; i ++){
            printf("%d ", res[i]);
        }
        printf("%d\n", res[n]);
    }
    return 0;
}