#include <bits/stdc++.h>
using namespace std;

int n;
string str;
int a[50][50];
int b[50][50];

int mid[50][50];
int now[50];

int main(){
	ios_base::sync_with_stdio(false);
	cin >> n;
	for (int i=1;i<=n;i++){
		cin >> str;
		for (int j=1;j<=n;j++) a[i][j]=str[j-1]-'0';	
	}
	for (int i=1;i<=n;i++){
		cin >> str;
		for (int j=1;j<=n;j++) b[i][j]=str[j-1]-'0';	
	}
//	cerr << "ok0" << endl;
	vector<pair<int,int>> ans;
	auto left = [&](int i){
		int tmp=a[i][1];
		for (int j=1;j<=n-1;j++) a[i][j]=a[i][j+1];
		a[i][n]=tmp;
		ans.emplace_back(0,i);	
	};
	auto down = [&](int j){
		int tmp=a[n][j];
		for (int i=n;i>=2;i--) a[i][j]=a[i-1][j];
		a[1][j]=tmp^1;
		ans.emplace_back(1,j);	
	};
	
	{
		for (int i=1;i<=n;i++) now[i]=2;
		for (int i=1;i<=n-1;i++)
			for (int j=2;j<=n;j++) mid[i][j]=b[i][j];
		for (int j=2;j<=n;j++) mid[n][j]=1;
		
		for (;count(now+1,now+n+1,n+1)!=n;){
			for (int i=1;i<=n;i++){
				while (now[i]<=n && a[i][1]==mid[i][now[i]]){
					now[i]++;
					left(i);	
				}
			}
			down(1);
		}
		for (int cc=1;cc<=n-1;cc++){
			left(n);
			down(1);	
		}
		for (;count(a[n]+1,a[n]+n+1,1)!=0;){
			for (;a[n][1]==0;) left(n);
			down(1);	
		}
	}
//	cerr << "ok1" << endl;
	vector<pair<int,int>> rev;
	auto right = [&](int i){
		int tmp=b[i][n];
		for (int j=n;j>=2;j--) b[i][j]=b[i][j-1];
		b[i][1]=tmp;
		rev.emplace_back(0,i);	
	};
	auto up = [&](int j){
		int tmp=b[1][j];
		for (int i=1;i<=n-1;i++) b[i][j]=b[i+1][j];
		b[n][j]=tmp^1;
		rev.emplace_back(1,j);	
	};
	
	{
		while (count(b[n]+2,b[n]+n+1,1)!=n-1){
			while (b[n][1]==1) right(n);
			up(1);	
		}
		for (int i=1;i<=n-1;i++){
			right(n);
			up(1);
		}
		while (count(b[n]+1,b[n]+n+1,0)!=n){
			while (b[n][1]!=1) right(n);
			up(1);	
		}
		for (int i=1;i<=n-1;i++) up(1);
	}
	reverse(rev.begin(),rev.end());
	for (auto e:rev) ans.emplace_back(e);
	
	cout << ans.size() << "\n";
	for (auto [x,y]:ans){
		if (x==0) cout << "row ";
		else cout << "column ";
		cout << y << "\n";	
	}
//	
//	cerr << "a : " << endl;
//	for (int i=1;i<=n;i++){
//		for (int j=1;j<=n;j++) cerr << a[i][j];
//		cerr << endl;	
//	}
//	cerr << "b : " << endl;
//	for (int i=1;i<=n;i++){
//		for (int j=1;j<=n;j++) cerr << b[i][j];
//		cerr << endl;	
//	}
	
	return 0;	
}