/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
const int mod=1e9+7;
const int inf=0x3f3f3f3f;
const int INF=1e18;
int fpow(int x,int b)
{
	if(x==0) return 0;
	if(b==0) return 1;
	int res=1;
	while(b>0)
	{
		if(b&1)	res=1LL*res*x%mod;
		x=1LL*x*x%mod;
		b>>=1;
	}
	return res;
}
mt19937 rnd(time(0));
const int T=5;
//const int T=500;
int n;
int A[2005][2005],B[2005][2005],badr[2005],badc[2005],chk[2005],mid[2005],tmp[2005];
int mat[21][21],hi[21],matidx=0,now[21],sol[21];
void solve()
{
	cin>>n;
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) cin>>A[i][j];
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) cin>>B[i][j];
	for(int _=0;_<T;_++)
	{
		for(int i=1;i<=n;i++) chk[i]=tmp[i]=rnd()%mod;
		for(int j=1;j<=n;j++){
			mid[j]=0;
			for(int i=1;i<=n;i++)
				mid[j]=(mid[j]+chk[i]*A[j][i])%mod;
		}
		swap(mid,chk);
		for(int j=1;j<=n;j++){
			mid[j]=0;
			for(int i=1;i<=n;i++)
				mid[j]=(mid[j]+chk[i]*B[j][i])%mod;
		}
		for(int i=1;i<=n;i++) if(mid[i]!=tmp[i]) badr[i]=1;
	}
	for(int _=0;_<T;_++)
	{
		for(int i=1;i<=n;i++) chk[i]=tmp[i]=rnd()%mod;
		for(int j=1;j<=n;j++){
			mid[j]=0;
			for(int i=1;i<=n;i++)
				mid[j]=(mid[j]+chk[i]*A[i][j])%mod;
		}
		swap(mid,chk);
		for(int j=1;j<=n;j++){
			mid[j]=0;
			for(int i=1;i<=n;i++)
				mid[j]=(mid[j]+chk[i]*B[i][j])%mod;
		}
		for(int i=1;i<=n;i++) if(mid[i]!=tmp[i]) badc[i]=1;
	}
//	for(int i=1;i<=n;i++) if(badc[i]) cout<<i<<" ";
//	cout<<"\n";
//	for(int i=1;i<=n;i++) if(badr[i]) cout<<i<<" ";
//	cout<<"\n";
	vector <array<int,3> > ans;
	for(int col=1;col<=n;col++) if(badc[col])
	{
		vector <int> idx;
		idx.pb(-1);
		int m=0;
		for(int row=1;row<=n;row++) if(badr[row]) idx.pb(row),m++;
		matidx=0;
		memset(mat,0,sizeof(mat));
		memset(hi,0,sizeof(hi));
		for(int i=1;i<=n;i++) 
		{
			memset(now,0,sizeof(now));
			for(int j=1;j<=m;j++) now[j]=A[i][idx[j]];
			for(int l=1;l<=n;l++) now[m+1]=(now[m+1]+A[i][l]*B[l][col])%mod;
			if(i==col) now[m+1]--,now[m+1]=(now[m+1]+mod)%mod;
			now[m+1]=(mod-now[m+1])%mod;
//			cout<<col<<" "<<i<<"\n";
//			for(int j=1;j<=m+1;j++) cout<<now[j]<<" ";
//			cout<<"\n";
//			system("pause"); 
			for(int j=1;j<=matidx;j++)
			{
				int coef=now[hi[j]]*fpow(mat[j][hi[j]],mod-2)%mod;
//				cout<<"---> "<<j<<" "<<hi[j]<<" "<<coef<<"\n";
				for(int l=1;l<=m+1;l++) now[l]=(now[l]-coef*mat[j][l]%mod+mod)%mod;
			}
			int ok=0;
			for(int l=1;l<=m;l++) if(now[l]) 
			{
				ok=l;
				break;
			}
			if(ok)
			{
				int pos=matidx+1;
				for(int j=matidx;j>=1;j--) if(hi[j]>ok) swap(hi[j],hi[j+1]),swap(mat[j],mat[j+1]),pos--;
				hi[pos]=ok;
				for(int j=1;j<=m+1;j++) mat[pos][j]=now[j];
				matidx++;
			}
//			for(int j=1;j<=matidx;j++)
//			{
//				for(int l=1;l<=m+1;l++) cout<<mat[j][l]<<" ";
//				cout<<"\n"; 
//			}
//			system("pause");
//			cout<<i<<" "<<matidx<<"\n";
		}
//		cout<<"done\n";
//cout<<"... "<<m<<"\n";
//		for(int j=1;j<=m;j++)
//		{
//			for(int l=1;l<=m+1;l++) cout<<mat[j][l]<<" ";
//			cout<<"\n";
//		}
//		system("pause");
		memset(sol,0,sizeof(sol));
		for(int j=m;j>=1;j--)
		{
			sol[j]=mat[j][m+1]%mod;
			for(int l=j+1;l<=m;l++) sol[j]=(sol[j]-mat[j][l]*sol[l]%mod+mod)%mod;
			sol[j]=sol[j]*fpow(mat[j][j],mod-2)%mod;
		}
		for(int i=1;i<=m;i++) if(sol[i]) ans.pb({idx[i],col,(sol[i]+B[idx[i]][col]+mod)%mod});
	}
	sort(ans.begin(),ans.end());
	cout<<ans.size()<<"\n";
	for(int i=0;i<ans.size();i++) cout<<ans[i][0]<<" "<<ans[i][1]<<" "<<ans[i][2]<<"\n";
}
signed main()
{
//	freopen("G.in","r",stdin);
//	freopen("G.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}