#pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")
#ifdef LOCAL
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>
#else
#include <bits/stdc++.h>
#endif

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
inline bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
inline bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef LOCAL
#define D for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define D while (false)
#define LOG(...)
#endif // LOCAL

const int max_n = 2011, inf = 1000111222;

const int mod = 1000000007;


inline void inc(int &x, int y) {
    x += y;
    if (x >= mod) {
        x -= mod;
    }
}

inline void dec(int &x, int y) {
    x -= y;
    if (x < 0) {
        x += mod;
    }
}

inline int mul(int x, int y) {
    return (1LL * x * y) % mod;
}

int power(int x, int y) {
    if (y < 0) {
        y += mod - 1;
    }
    if (y == 0) {
        return 1;
    }
    if (y % 2 == 0) {
        return power(mul(x, x), y / 2);
    }
    return mul(x, power(x, y - 1));
}

inline int inv(int x) {
    return power(x, mod - 2);
}


// new mint part


inline int divide (int x, int y) {
    return mul(x, inv(y));
}

struct mint {
#define oper_apply(op, f) mint& operator op (const mint &x) {f(val, x.val); return *this;}
#define oper_apply_const(op, f) mint operator op (const mint &x) const {mint tmp = *this; f(tmp.val, x.val); return tmp;}
#define oper_return(op, f) mint& operator op (const mint &x) {val = f(val, x.val); return *this;}
#define oper_return_const(op, f) mint operator op (const mint &x) const {return mint(f(val, x.val));}

    int val;

    mint(int x = 0) : val(x) {}

    oper_apply(+=, inc);
    oper_apply_const(+, inc);
    oper_apply(-=, dec);
    oper_apply_const(-, dec);
    oper_return(*=, mul);
    oper_return_const(*, mul);
    oper_return(/=, divide);
    oper_return_const(/, divide);
    oper_return(^=, power);
    oper_return_const(^, power);
};

mt19937 rng(228);
template<typename T = int>
inline T randll(T l = INT_MIN, T r = INT_MAX) {
    return uniform_int_distribution<T>(l, r)(rng);
}

inline ld randld(ld l = INT_MIN, ld r = INT_MAX) {
    return uniform_real_distribution<ld>(l, r)(rng);
}

inline vector <mint> mult (vector <vector <mint> > &a, vector <mint> &b) {
    int n = len(b);
    vector <mint> res(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            res[i] += a[i][j] * b[j];
        }
    }
    return res;
}

inline vector <mint> mult (vector <mint> &b, vector <vector <mint> > &a) {
    int n = len(b);
    vector <mint> res(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            res[i] += b[j] * a[j][i];
        }
    }
    return res;
}

mint dp[max_n][13] = {};
mint val[max_n] = {}, sol[13] = {};

inline void solve (int n, int k) {
    for (int i = 0; i < n; i++) {
        int pos = -1;
        for (int j = 0; j < k; j++) {
            if (dp[i][j].val != 0) {
                pos = j;
                break;
            }
        }
        if (pos == -1) {
            LOG(val[i].val);
            assert(val[i].val == 0);
            continue;
        }
        mint inv = mint(1) / dp[i][pos];
        for (int j = 0; j < k; j++) {
            dp[i][j] *= inv;
        }
        val[i] *= inv;
        for (int j = 0; j < n; j++) {
            if (i == j || dp[j][pos].val == 0) {
                continue;
            }
            mint now = dp[j][pos];
            for (int i1 = 0; i1 < k; i1++) {
                dp[j][i1] -= now * dp[i][i1];
            }
            val[j] -= now * val[i];
        }
    }
    for (int i = 0; i < k; i++) {
        sol[i] = 0;
        for (int j = 0; j < n; j++) {
            if (dp[j][i].val) {
                sol[i] = val[j];
                break;
            }
        }
    }
}

const int debug = 0;

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector <vector <mint> > a(n, vector <mint> (n));
    vector <vector <mint> > b(n, vector <mint> (n));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (!debug) {
                cin >> a[i][j].val;
            }
            else {
                a[i][j].val = i == j;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (!debug) {
                cin >> b[i][j].val;
            }
            else {
                b[i][j].val = i == j;
            }
        }
    }
    if (debug) {
        set <int> X, Y;
        for (int i = 0; i < 12; i++) {
            int x = randll(0, n - 1);
            int y = randll(0, n - 1);
            int c = randll(0, mod - 1);
            X.insert(x);
            Y.insert(y);
            b[x][y].val = c;
        }
        LOG(len(X), len(Y));
    }
    vector <int> col(n), row(n);
    int cnt = 0, gg = 0;
    vector<int> have;
    for (int it = 0; it < 2; it++) {
        vector<mint> v(n);
        for (int i = 0; i < n; i++) {
            v[i] = randll(0, mod - 1);
        }
        auto v1 = mult(v, a);
        v1 = mult(v1, b);
        for (int i = 0; i < n; i++) {
            if (col[i]) {
                continue;
            }
            if (v1[i].val != v[i].val) {
                col[i] = 1;
                ++gg;
            }
        }
        auto v2 = mult(a, v);
        v2 = mult(b, v2);
        for (int i = 0; i < n; i++) {
            if (row[i]) {
                continue;
            }
            if (v2[i].val != v[i].val) {
                row[i] = 1;
                ++cnt;
                have.pb(i);
            }
        }
    }
    vector <pair<pii, int> > ans;
    LOG(cnt);
    if (gg >= 13) {
        exit(0);
    }
    if (cnt >= 13) {
        cout << "!!!\n";
        exit(0);
    }
    assert(cnt < 13);
    for (int i = 0; i < n; i++) {
        if (!col[i]) {
            continue;
        }
        vector <mint> now(n);
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < n; k++) {
                now[j] += a[j][k] * b[k][i];
            }
            if (j == i) {
                now[j] -= 1;
            }
            val[j] = now[j];
//            LOG(j, now[j].val);
        }
        int num = 0;
        for (auto &j : have) {
            for (int k = 0; k < n; k++) {
                dp[k][num] = a[k][j];
            }
            ++num;
        }
        solve(n, cnt);
        for (int j = 0; j < cnt; j++) {
            if (sol[j].val != 0) {
//                LOG(j, sol[j].val);
                mint real_val = b[have[j]][i] - sol[j].val;
                ans.pb({{have[j], i}, real_val.val});
            }
        }
    }
    sort(all(ans));
    cout << len(ans) << '\n';
    for (auto &i : ans) {
        cout << i.first.first + 1 << ' ' << i.first.second + 1 << ' ' << i.second << '\n';
    }
}