#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=2e3,Mod=1e9+7;

inline int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0' || ch>'9')
    {
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0' && ch<='9')
    {
        x=x*10+ch-'0';
        ch=getchar();
    }
    return x*f;
}
inline int Pow(int x,int y)
{
    int res=1;
    while(y)
    {
        if(y&1) res=1ll*res*x%Mod;
        x=1ll*x*x%Mod,y>>=1;
    }
    return res;
}

int n,a[Maxn+5][Maxn+5],b[Maxn+5][Maxn+5],c[Maxn+5][Maxn+5];
int v1[Maxn+5],v2[Maxn+5],f[15][15],m; vector<int> w1,w2;
mt19937 rnd(time(0));

inline void Gauss()
{
    For(i,1,m)
    {
        int p=i; For(j,i,m) if(f[j][i]) {p=j; break;}
        if(p!=i) swap(f[i],f[p]); p=Pow(f[i][i],Mod-2);
        For(j,i,m+1) f[i][j]=1ll*f[i][j]*p%Mod;
        For(j,i+1,m)
        {
            p=(Mod-f[j][i])%Mod;
            For(k,i,m+1) f[j][k]=(f[j][k]+1ll*f[i][k]*p)%Mod;
        }
    }
    Rof(i,m,1) Rof(j,i-1,1) f[j][m+1]=(f[j][m+1]-1ll*f[i][m+1]*f[j][i]%Mod+Mod)%Mod;
}

int main()
{
    // freopen("1.in","r",stdin);

    n=read();
    For(i,1,n) For(j,1,n) a[i][j]=read();
    For(i,1,n) For(j,1,n) b[i][j]=read();
    memcpy(c,b,sizeof(b));
    For(_,1,20)
    {
        static int f[Maxn+5],g[Maxn+5],h[Maxn+5];
        For(i,1,n) f[i]=rnd()%Mod,g[i]=h[i]=0;
        For(i,1,n) For(j,1,n) g[j]=(g[j]+1ll*f[i]*a[i][j])%Mod;
        For(i,1,n) For(j,1,n) h[j]=(h[j]+1ll*g[i]*b[i][j])%Mod;
        For(i,1,n) if(f[i]!=h[i]) v2[i]=1;
    }
    For(_,1,20)
    {
        static int f[Maxn+5],g[Maxn+5],h[Maxn+5];
        For(i,1,n) f[i]=rnd()%Mod,g[i]=h[i]=0;
        For(i,1,n) For(j,1,n) g[i]=(g[i]+1ll*f[j]*a[i][j])%Mod;
        For(i,1,n) For(j,1,n) h[i]=(h[i]+1ll*g[j]*b[i][j])%Mod;
        For(i,1,n) if(f[i]!=h[i]) v1[i]=1;
    }
    For(i,1,n) if(v1[i]) w1.push_back(i); m=w1.size();
    For(i,1,n) if(v2[i]) w2.push_back(i);
    for(auto j:w2)
    {
        memset(f,0,sizeof(f)); static int id[Maxn+5];
        iota(id+1,id+n+1,1),shuffle(id+1,id+n+1,rnd);
        For(i,1,m)
        {
            int cur=0,p=id[i]; For(k,1,n)
            {
                if(v1[k]) f[i][++cur]=a[p][k];
                else f[i][m+1]=(f[i][m+1]-1ll*a[p][k]*b[k][j]%Mod+Mod)%Mod;
            } if(p==j) (f[i][m+1]+=1)%=Mod;
        } Gauss();
        For(i,1,m) c[w1[i-1]][j]=f[i][m+1];
    }
    vector<pair<int,int>> ans;
    For(i,1,n) For(j,1,n) if(b[i][j]!=c[i][j]) ans.emplace_back(i,j);
    cout<<ans.size()<<endl;
    for(auto [x,y]:ans) cout<<x<<' '<<y<<' '<<c[x][y]<<endl;
    return 0;
}