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

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0);
#define iter(a) a.begin(), a.end()
#define pb emplace_back
#define ff first
#define ss second
#define SZ(a) int(a.size())

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#ifdef zisk
void debug(){cerr << "\n";}
template<class T, class ... U> void debug(T a, U ... b){cerr << a << " ", debug(b...);}
template<class T> void pary(T l, T r) {
	while (l != r) cerr << *l << " ", l++;
	cerr << "\n";
}
#else
#define debug(...) void()
#define pary(...) void()
#endif

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.ff << ',' << p.ss << ')';
}

const ll MOD = 1000000007;
using matrix = vector<vector<ll>>;

matrix operator*(const matrix &a, const matrix &b){
    matrix c(SZ(a), vector<ll>(SZ(b[0])));
    for(int i = 0; i < SZ(a); i++)
        for(int j = 0; j < SZ(b[0]); j++)
            for(int k = 0; k < SZ(b); k++){
                c[i][j] += a[i][k] * b[k][j] % MOD;
                c[i][j] %= MOD;
            }
    return c;
}

ll inv(ll a){
    ll b = MOD - 2;
    ll ans = 1;
    while(b){
        if(b & 1) ans = ans * a % MOD;
        b >>= 1;
        a = a * a % MOD;
    }
    return ans;
}

void topos(ll &a){
    a = (a % MOD + MOD) % MOD;
}


void debug_matrix(const matrix &mat){
    debug("matrix");
    for(auto &i : mat) pary(iter(i));
}

void gauss(matrix &mat){
    //debug("gauss");
    //debug_matrix(mat);
    int n = SZ(mat);
    for(int i = 0; i < n; i++){
        for(int j = i; j < n; j++)
            if(mat[j][i] != 0){
                mat[i].swap(mat[j]);
                break;
            }
        ll t = inv(mat[i][i]);
        for(int j = i; j < SZ(mat[i]); j++)
            mat[i][j] = mat[i][j] * t % MOD;
        for(int j = 0; j < n; j++){
            if(i == j) continue;
            t = mat[j][i];
            for(int k = i; k < SZ(mat[i]); k++){
                mat[j][k] -= t * mat[i][k] % MOD;
                topos(mat[j][k]);
            }
        }
        //debug("ok row", i);
        //debug_matrix(mat);
    }
}

matrix matrix_inv(matrix a){
    int n = SZ(a);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++)
            a[i].pb(i == j);
    }
    gauss(a);
    matrix ans(n);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++)
            ans[i].pb(a[i][n + j]);
    }
    return ans;
}

int main(){
    StarBurstStream;
    mt19937 rng(880301);
    //mt19937 gen(123123);

    int n;
    cin >> n;
    matrix a(n, vector<ll>(n));
    matrix c(n, vector<ll>(n));
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++){
            cin >> a[i][j];
            //a[i][j] = gen() % MOD;
        }
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            cin >> c[i][j];
    /*c = matrix_inv(a);
    for(int i = 0; i < 12; i++){
        int x = gen() % n;
        int y = gen() % n;
        c[x][y] = gen() % MOD;
    }*/
    //debug_matrix(a);
    //debug_matrix(c);
    
    matrix v(n, vector<ll>(1));
    for(int i = 0; i < n; i++) v[i][0] = rng() % MOD;

    matrix tmp = c * (a * v);
    //debug_matrix(v);
    //debug_matrix(tmp);
    vector<int> bad_row, bad_col;
    vector<bool> col(n);
    for(int i = 0; i < n; i++){
        if(tmp[i][0] != v[i][0]) bad_row.pb(i);
    }

    v = matrix(1, vector<ll>(n));
    //debug_matrix(v);
    //debug_matrix(tmp);
    for(int i = 0; i < n; i++) v[0][i] = rng() % MOD;
    tmp = v * a * c;
    for(int i = 0; i < n; i++){
        if(tmp[0][i] != v[0][i]) bad_col.pb(i), col[i] = true;
    }

    //pary(iter(bad_row));
    //pary(iter(bad_col));
    
    vector<pair<pii, ll>> sol;
    for(int i : bad_row){
        //debug("bad row", i);
        vector<vector<ll>> mat;
        for(int j = 0; j < SZ(bad_col); j++){
            mat.pb();
            ll sum = 0;
            for(int k = 0; k < n; k++){
                if(col[k]) mat.back().pb(a[k][j]);
                else sum += c[i][k] * a[k][j] % MOD;
            }
            topos(sum);
            mat.back().pb(-sum + (i == j));
            //debug("ok", i, j, sum);
        }
        //debug_matrix(mat);
        gauss(mat);
        //debug_matrix(mat);
        for(int j = 0; j < SZ(bad_col); j++){
            if(mat[j].back() != c[i][bad_col[j]]){
                sol.pb(make_pair(pii(i + 1, bad_col[j] + 1), mat[j].back()));
                c[i][bad_col[j]] = mat[j].back();
            }
        }
    }
    /*matrix I(n, vector<ll>(n));
    for(int i = 0; i < n; i++) I[i][i] = 1;
    assert(a * c == I);*/

    cout << SZ(sol) << "\n";
    for(auto [p, val] : sol) cout << p.ff << " " << p.ss << " " << val << "\n";

}