#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
inline ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-f;ch=getchar();}
	while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	return x*f;
}
inline void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
const ll N=2e3+9;
ll T,n;
char e[N][N];
void solve(){
	rep(i,1,n)scanf("%s",e[i]+1);
	vector<ll>ans(1,1);
	rep(i,2,n){
		ll fl=1,lst=-1;
		rep(j,0,(ll)ans.size()-1){
			ll es=e[ans[j]][ans[(j+1)%ans.size()]]-'0';
			if((!(~lst))||es==lst)lst=es;
			else fl=0;
		}
		if(fl)ans.push_back(i);
		else {
			rep(j,0,(ll)ans.size()-1){
				ll es1=e[ans[j]][ans[(j+1)%ans.size()]]-'0';
				ll es2=e[ans[(j+1)%ans.size()]][ans[(j+2)%ans.size()]]-'0';
				if(es1==0||es2==1)continue;
				ll es3=e[ans[(j+1)%ans.size()]][i]-'0';
				if(!es3)ans.insert(ans.begin()+j,i);
				else ans.insert(ans.begin()+(j+1)%ans.size(),i);
			}
		}
	}
	rep(i,0,(ll)ans.size()-1){
		ll cnt=0,lst=e[ans[i]][ans[(i+1)%ans.size()]]-'0';
		rep(j,1,(ll)ans.size()-1){
			ll es=e[ans[(i+j)%ans.size()]][(i+j+1)%ans.size()]-'0';
			if(lst!=es)cnt++;
			lst=es;
		}
		if(cnt<=1){
			rep(j,0,(ll)ans.size()-1)write(ans[(i+j)%ans.size()]),putchar(' ');
			return ;
		}
	}
	puts("-1");
}
bool Med;
int main(){
	cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
	while(cin>>n)solve();
	return 0;
}