# include <stdio.h>
# include <malloc.h>
main()
{ int xx[101][101],a[101],b[101],i,n,j,x=0,y=0;
typedef struct node{ int x,y,flag;struct node *link;} JD; JD *h,*r,*v;
h=(JD *)malloc(sizeof(JD));h->link=NULL;r=h;for (i=0;i<=100;i++) {a[i]=0;b[i]=0;}
scanf("%d",&n);
while (n!=0 && n<100)
{for (i=1;i<=n;i++)
{	for (j=1;j<=n;j++){scanf("%d",&xx[i][j]);if (xx[i][j]!=0 ||xx[i][j] !=1) return(0);a[i]+=xx[i][j];b[j]+=xx[i][j];}
}
for (i=1;i<=n;i++)
{v=(JD *)malloc(sizeof(JD));
for (i=1;i<=n;i++){if ((a[i]%2)!=0) x=x+1;if ((b[i]%2)!=0) y=y+1;}
if (x==1&&y==1) {v->flag=1;for (i=1;i<=n;i++) {if ((a[i]%2!=0)) {v->x=i;}if ((b[i]%2!=0)) {v->y=i;} }v->link=NULL;h->link=v;h=h->link;}
else if(x==0 && y==0) {v->flag=0;
v->link=NULL;h->link=v;h=h->link;}
else {v->flag=-1;
v->link=NULL;h->link=v;h=h->link;}
}scanf("%d",&n);x=0;y=0;
for (j=1;j<=n;j++){a[i]=0;b[j]=0;}
}
r=r->link;
for(;r->link!=NULL;){if (r->flag==0) printf("OK\n");if (r->flag==1) printf("Change bit (%d,%d)\n",r->x,r->y);if (r->flag==-1) printf("Corrupt\n");r=r->link;}
if (r->flag==0) printf("OK\n");if (r->flag==1) printf("Change bit (%d,%d)\n",r->x,r->y);if (r->flag==-1) printf("Corrupt\n");
}