// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 1000005
#define inf 0x3f3f3f3f

int n,a[25][25],b[25][25],st[25],go[25][25];
int f[1<<20|5]; pii pf[1<<20|5];
int g[1<<20|5]; pii pg[1<<20|5];

vector<pii>out;
void row(int i){
	out.pb(mkp(i,0));
	int p=a[i][0];
	For(j,0,n-2) a[i][j]=a[i][j+1];
	a[i][n-1]=p;
}
void col(int i){
	out.pb(mkp(i,1));
	int p=a[n-1][i];
	Rep(j,n-1,1) a[j][i]=a[j-1][i];
	a[0][i]=!p;
}

int rd(){
	char ch;
	while(!isdigit(ch=getchar()));
	return ch&1;
}
void print(){
	For(i,0,n-1){
		For(j,0,n-1)cout<<a[i][j];
		cout<<"\n";
	}
}
signed main()
{
	n=read();
	For(i,0,n-1)For(j,0,n-1)a[i][j]=rd();
	For(i,0,n-1)For(j,0,n-1)b[i][j]=rd();
	int xo=0;
	For(i,0,(1<<n)-1) f[i]=inf;
	For(i,0,n-1){
		int s=0;
		For(j,0,n-1)if(a[j][i]!=b[j][i])s^=(1<<j);
		xo^=s;
		st[i]=s;
	}
	f[xo]=0;
//	cout<<"xor "<<xo<<"\n";
	
	For(i,0,n-1){
		int ta=0,tb=0;
		For(j,0,n-1) ta|=(a[j][i]<<j),tb|=(b[j][i]<<j);
		memcpy(g,f,sizeof g);
		For(j,1,2*n-1){
			int o=(ta>>(n-1)&1);
			ta<<=1,ta^=(o<<n),ta^=(!o);
			
			int t=st[i]^ta^tb;
			go[i][j]=t;
			For(s,0,(1<<n)-1)
				if(f[s]+j<g[s^t]) g[s^t]=f[s],pg[s^t]=mkp(i,j);
		}
		For(s,0,(1<<n)-1)
			if(g[s]<f[s]) f[s]=g[s],pf[s]=pg[s];
	}
	
	int now=0;
	if((n-1)%2) now=(1<<n)-1;
	int mn=f[now];
	if(mn==inf) exit(233);
	
	while(now!=xo){
		pii p=pf[now];
		int i=p.fi,j=p.se;
		now^=go[i][j];
	//	cout<<"turn "<<i<<" "<<j<<"\n";
		For(_,1,j) col(i);
	}
	
//	For(i,0,n-1){
//		For(j,0,n-1)cout<<b[i][j]<<" \n"[j==n-1];
//	}
	
	For(j,0,n-2){
		vi o;
	//	For(i,0,n-1) cout<<b[i][j]; cout<<" b\n";
		
	//	print(); puts("-a-");
		For(i,0,n-1)
			if(b[i][j]==a[i][n-1]) row(i);//cout<<"R "<<i<<"\n";
			else o.pb(i);
	//	print(); puts("--");
		For(_,1,n) col(n-1);
		for(int i:o) row(i);
		
	//	print(); puts("-----");
	}
	
	
	cout<<out.size()<<"\n";
	for(auto [x,y]:out) cout<<(y?"column":"row")<<" "<<x+1<<"\n";
	return 0;
}
/*

3
000
110
010

101
110
011

3
000
110
010

101
110
011
4
1011
1100
0100
1011

1001
0110
0110
1001
*/