#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
int mp[5005][5005], n, cnt, hr[5005], hb[5005], lr[5005], lb[5005],vis[5005][5005];
struct node {
	int pd, x, col;
} ans[8005];
signed main() {
//	freopen("bojanje.in.1l", "r", stdin);
//	freopen("1l.out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	bool pd = 0;
	for (int i = 1; i <= n; i++) {
		int suml = 0, sumr = 0;
		for (int j = 1; j <= n; j++) {
			cin >> mp[i][j];
			if (mp[i][j] != 1)suml++;
			if (mp[i][j] != 2)sumr++;
		}
		//if (suml != 0 || sumr != 0)pd = 1;
		hr[i] = suml;
		hb[i] = sumr;
		//cout<<hr[i]<<" "<<hb[i]<<endl;
	}
	for (int i = 1; i <= n; i++) {
		int suml = 0, sumr = 0;
		for (int j = 1; j <= n; j++) {
			if (mp[j][i] != 1)suml++;
			if (mp[j][i] != 2)sumr++;
		}
		//if (suml != 0 || sumr != 0)pd = 1;
		lr[i] = suml;
		lb[i] = sumr;
		//cout<<lr[i]<<" "<<lb[i]<<endl;
	}
	while (1) {
		bool bj=0;
		for (int i = 1; i <= n; i++) {
			if (hr[i] == 0) {
				bj=1;
				hr[i]=0x7fffffff;
				for (int j = 1; j <= n; j++) {
					lb[j]--;
					vis[i][j]=1;
				}
				ans[++cnt].pd = 1;
				ans[cnt].x = i;
				ans[cnt].col = 1;
			}
			if (hb[i] == 0) {
				hb[i]=0x7fffffff;
				bj=1;
				for (int j = 1; j <= n; j++) {
					lr[j]--;
					vis[i][j]=1;
				}
				ans[++cnt].pd = 1;
				ans[cnt].x = i;
				ans[cnt].col = 2;
			}
		}
		for (int i = 1; i <= n; i++) {
			if (lr[i] == 0) {
				lr[i]=0x7fffffff;
				bj=1;
				for (int j = 1; j <= n; j++) {
					hb[j]--;
					vis[j][i]=1;
				}
				ans[++cnt].pd = 2;
				ans[cnt].x = i;
				ans[cnt].col = 1;
			}
			if (lb[i] == 0) {
				lb[i]=0x7fffffff;
				bj=1;
				for (int j = 1; j <= n; j++) {
					hr[j]--;
					vis[j][i]=1;
				}
				ans[++cnt].pd = 2;
				ans[cnt].x = i;
				ans[cnt].col = 2;
			}
		}
		if(bj==0)break;
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(vis[i][j]==1)continue;
			if(mp[i][j]!=0){
				//cout<<i<<" "<<j<<endl;
				pd=1;
				break;
			}
		}
	}
	if (pd == 1) {
		cout << -1;
		return 0;
	}
	cout << cnt << endl;
	for (int i = cnt; i >= 1; i--) {
		cout << ans[i].pd << " " << ans[i].x << " " << ans[i].col << endl;
	}
	return 0;
}
/*
3
1 1 2
2 1 1
2 1 1
*/

不知道为什么，我的输出方案和答案的输出方案得到的是同一个图，跑完之后fc都找不出差异，但就是WA了（懵）