#include <bits/stdc++.h>

using namespace std;


#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, n) for(int i = 0; i < n; i += 1)
#define len(a) ((int)(a).size())


const ll inf = 1e18;
mt19937 rnd(234);
const ll mod = 1e9 + 7;


ll bin_pow(ll x, ll n) {
    ll result = 1;
    for (ll i = 1, a = x; i <= n; i *= 2, a = (a * a) % mod) {
        if (n & i) {
            result = (result * a) % mod;
        }
    }
    return result;
}


ll inv(ll x) {
    ll a = bin_pow(x, mod - 2);
    assert(a * x % mod == 1);
    return a;
}


int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    int n;
    cin >> n;
    vector<vector<ll>> a(n, vector<ll>(n)), c(n, vector<ll>(n));
    rep(i, n) rep(j, n) cin >> a[i][j];
    rep(i, n) rep(j, n) cin >> c[i][j];
    vector<ll> f(n);
    rep(i, n) f[i] = rnd() % mod;
    vector<ll> fa(n);
    rep(i, n) rep(j, n) fa[j] = (fa[j] + f[i] * a[i][j]) % mod;
    vector<ll> fac(n);
    rep(i, n) rep(j, n) fac[j] = (fac[j] + fa[i] * c[i][j]) % mod;
    vector<ll> x = fac;
    rep(i, n) x[i] = (x[i] + mod - f[i]) % mod;
    vector<int> changed_cols;
    rep(i, n) if (x[i] != 0) changed_cols.push_back(i);
    assert(len(changed_cols) <= 12);

    vector<ll> af(n);
    rep(i, n) rep(j, n) af[i] = (af[i] + a[i][j] * f[j]) % mod;
    vector<ll> caf(n);
    rep(i, n) rep(j, n) caf[i] = (caf[i] + c[i][j] * af[j]) % mod;
    vector<ll> y = caf;
    rep(i, n) y[i] = (y[i] + mod - f[i]) % mod;
    vector<int> changed_rows;
    rep(i, n) if (y[i] != 0) changed_rows.push_back(i);
    assert(len(changed_rows) <= 12);

    vector<array<ll, 3>> result;
    int p = len(changed_rows);
    int q = len(changed_cols);
    vector<vector<ll>> mat(n, vector<ll>(p + q));
    rep(j, p) rep(i, n) mat[i][j] = a[i][changed_rows[j]];
    rep(j, q) {
        auto col = changed_cols[j];
        vector<ll> b(n);
        rep(i, n) rep(j, n) b[i] = (b[i] + a[i][j] * c[j][col]) % mod;
        b[col] = (b[col] + mod - 1) % mod;
        rep(i, n) mat[i][p + j] = b[i];
    }
    rep(j, p) {
        for (int i = j; i < n; i += 1) {
            if (mat[i][j] != 0) {
                swap(mat[i], mat[j]);
                break;
            }
        }
        assert(mat[j][j] != 0);
        ll x = inv(mat[j][j]);
        rep(k, p + q) mat[j][k] = (mat[j][k] * x) % mod;
        assert(mat[j][j] == 1);
        for (int i = 0; i < n; i += 1) {
            if (i == j) continue;
            if (mat[i][j] == 0) continue;
            ll y = mat[i][j];
            rep(k, p + q) mat[i][k] = ((mat[i][k] - mat[j][k] * y) % mod + mod) % mod;
            assert(mat[i][j] == 0);
        }
    }
    rep(col_id, q) {
        int col = changed_cols[col_id];
        rep(row_id, p) {
            int row = changed_rows[row_id];
            ll diff = mat[row_id][p + col_id];
            if (diff != 0) {
                result.push_back({ row, col, (c[row][col] + mod - diff) % mod });
            }
        }
    }

    assert(len(result) <= 12);
    sort(all(result));
    cout << len(result) << "\n";
    for (auto [x, y, w] : result) {
        cout << x + 1 << " " << y + 1 << " " << w << "\n";
    }
    return 0;
}