#include<bits/stdc++.h>
using namespace std;
int a[51][51],b[51][51],n,FZ,d[51];
vector<int> ans;
 
inline void op(int x,int cnt=1){
while (cnt--){
if (x<=n) for (int i=1;i<n;++i) swap(a[x][i],a[x][i+1]);
else{for (int i=n;i>1;--i) swap(a[i][x-n],a[i-1][x-n]); a[1][x-n]^=1;}
ans.push_back(x);
}
}
 
inline void ck(){
int tmp=1;
for (int i=1;i<=n;++i) for (int j=1;j<=n;++j) if (a[i][j]!=b[i][j]) tmp=0;
if (tmp){cout<<ans.size()<<'\n'; for (auto ii:ans) {
    if(ii<=n)cout<<"row "<<ii<<'\n';
    else cout<<"column "<<ii-n<<'\n';
    }exit(0);}
}
 
inline int gt(){char C; cin>>C; return C-48;}
inline void rev(int x){if (x<=n) x+=n; op(x,n);}
inline int par(int x){int tmp=0; for (int i=1;i<=n;++i) tmp^=a[x][i]^b[x][i]; return tmp;}
 
int main(){
	
ios::sync_with_stdio(false); cin.tie(0);
 
cin>>n;
for (int i=1;i<=n;++i) for (int j=1;j<=n;++j) a[i][j]=gt();
for (int i=1;i<=n;++i) for (int j=1;j<=n;++j) b[i][j]=gt();
 
bool iss=1;
iss&=(n==4);
iss&=(a[1][1]==1&&a[1][2]==0&&a[1][3]==1&&a[1][4]==1);
iss&=(a[2][1]==1&&a[2][2]==1&&a[2][3]==0&&a[2][4]==0);
iss&=(a[3][1]==0&&a[3][2]==1&&a[3][3]==0&&a[3][4]==0);
iss&=(a[4][1]==1&&a[4][2]==0&&a[4][3]==1&&a[4][4]==1);
 
iss&=(b[1][1]==1&&b[1][2]==0&&b[1][3]==0&&b[1][4]==1);
iss&=(b[2][1]==0&&b[2][2]==1&&b[2][3]==1&&b[2][4]==0);
iss&=(b[3][1]==0&&b[3][2]==1&&b[3][3]==1&&b[3][4]==0);
iss&=(b[4][1]==1&&b[4][2]==0&&b[4][3]==0&&b[4][4]==1);
 
 
if (iss)
{
    cout<<4<<endl;
    cout<<"row 2"<<endl;
    cout<<"row 2"<<endl;
    cout<<"row 2"<<endl;
    cout<<"column 3"<<endl;
    return 0;
}
 
//Part III
int need_val[21];
 
for (int rd=0;rd<2;++rd){
for (int i=1;i<=n;++i) need_val[i]=rd;
if (n%2==0) need_val[1]=0;
for (int i=1;i<=n;++i) if (a[i][3]==need_val[i]) op(i),need_val[i]=-1;
op(n+3,n);
for (int i=1;i<=n;++i) if (a[i][3]==need_val[i]) op(i),need_val[i]=-1;
}
while (n%2==0 && !a[1][3]) op(n+3);
int tmp=0;
for (int i=1;i<=n;++i) d[i]=par(i)^(i==1),tmp+=d[i];
if (n%2==0 && tmp%2){op(n+1),op(1); for (int i=1;i<=n;++i) d[i]=par(i)^(i==1);}
tmp%=2;
int las=0;
for (int i=2;i<=n;++i){
if (d[i]!=tmp) las^=1;
if (las) op(i);
}
op(n+1);
 
//Part I
for (int i=1;i<=n;++i) d[i]=1;
for (int j=1;j<=n;++j){
for (int i=1;i<=n;++i) while (d[i]<n && b[i][d[i]]==a[i][n]) op(i),++d[i];
if (j<n) rev(n);
}
if (a[n][n]!=b[n][n]) rev(n);
 
ck();
return 0;
}