#include<bits/stdc++.h> using namespace std; #define int long long int read(){int x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();return x*f;} bool reab(){char c=getchar();while(c!='0'&&c!='1')c=getchar();return c=='1';} const int MAXN=4010,N=13; int n,m,s[MAXN][MAXN],a[MAXN][MAXN],f[N][N][1<<N],as[MAXN]; void slv0(){ memset(f,-1,sizeof(f)); f[0][0][0]=0; for(int i=0;i<=n;i++) for(int j=0;j<=n;j++){ for(int o=0;o<1<<n;o++)if(f[i][j][o]!=-1){ if(s[i+1][j]) for(int k=0;k<n;k++)if((!(o&(1<<k)))&&a[k][i+j+1])f[i+1][j][o|(1<<k)]=k; if(s[i][j+1])f[i][j+1][o]=n; } } if(f[n][n][(1<<n)-1]==-1)puts("-1"); else{ int x=n,y=n,d=(1<<n)-1,t=2*n; while(t--){ if(f[x][y][d]==n)y--; else as[f[x][y][d]]=t+1,d^=1<<f[x][y][d],x--; } for(int i=0;i<n;i++)printf("%lld ",as[i]); } } bool vis[MAXN]; void slv1(){ for(int i=0;i<n;i++){ int tmp=0; for(int j=1;j<=2*n;j++)if(!vis[j]&&a[i][j]){ tmp=j,vis[j]=1; break; } printf("%lld ",tmp); } } void slv(){ n=read(); for(int i=0;i<=n;i++)for(int j=0;j<=n;j++)s[i][j]=reab(); for(int i=0;i<n;i++)for(int j=1;j<=2*n;j++)a[i][j]=reab()^1; if(n<=12)slv0(); else slv1(); } signed main(){ // freopen("bus.in","r",stdin);freopen("bus.out","w",stdout); slv(); return 0; }