#include <bits/stdc++.h>

using namespace std;

vector<long double> solve(vector<vector<long double>> a) {
  int n = a.size();
  for (int i = 0; i < n; ++i) {
    int mx = i;
    for (int j = i + 1; j < n; ++j) {
      if (fabs(a[j][i]) > fabs(a[mx][i])) mx = j;
    }
    a[i].swap(a[mx]);
    for (int j = 0; j < n; ++j) {
      if (j != i) {
        long double t = a[j][i] / a[i][i];
        for (int k = i + 1; k <= n; ++k) a[j][k] -= a[i][k] * t;
      }
    }
  }
  vector<long double> ret;
  for (int i = 0; i < n; ++i) {
    ret.push_back(a[i][n] / a[i][i]);
  }
  return ret;
}

int main() {
  int n;
  cin >> n;
  vector f(n, vector<int>(n));
  for (int i = 0; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      cin >> f[i][j];
      f[j][i] = f[i][j];
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      int x;
      cin >> x;
      f[i][j] -= x;
      f[j][i] -= x;
    }
  }
  
  vector<array<int, 5>> ans;
  auto add = [&](int a, int b, int c, int d, int x) {
    f[a][b] += x, f[b][a] += x;
    f[a][c] += x, f[c][a] += x;
    f[a][d] += x, f[d][a] += x;
    f[b][c] -= x, f[c][b] -= x;
    f[b][d] -= x, f[d][b] -= x;
    f[c][d] -= x, f[d][c] -= x;
    ans.push_back({a, b, c, d, x});
  };
  for (int i = 4; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      if (f[i][j] % 2 == 1) {
        add(i, j, 0, 1, 1);
      }
    }
  }
  for (int i = 4; i < n; ++i) {
    vector t = {0, 1, 2, 3};
    sort(t.begin(), t.end(), [&](int x, int y) { return f[i][x] % 2 > f[i][y] % 2; });
    int cnt = 0;
    for (int x : t) cnt += f[i][x] % 2;
    if (cnt == 1) {
      add(i, t[0], t[1], t[2], 1);
      add(i, t[0], t[1], t[3], 1);
      add(i, t[0], t[2], t[3], 1);
    } else if (cnt == 2) {
      add(i, t[1], t[2], t[3], 1);
      add(i, t[0], t[2], t[3], 1);
    } else if (cnt == 3) {
      add(i, t[0], t[1], t[2], 1);
    } else if (cnt == 4) {
      add(i, t[1], t[2], t[3], 1);
      add(i, t[0], t[1], t[2], 1);
      add(i, t[0], t[1], t[3], 1);
      add(i, t[0], t[2], t[3], 1);
    }
  }
  for (int i = 4; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      assert(f[i][j] % 2 == 0);
      int v = f[i][j] / 2;
      if (!v) continue;
      add(i, j, 0, 1, -v);
      add(j, i, 0, 1, -v);
    }
    for (int j = 0; j < 4; ++j) {
      int x = (j + 1) % 4, y = (j + 2) % 4;
      int v = f[i][j] / 2;
      if (!v) continue;
      add(i, j, x, y, -v);
      add(j, i, x, y, -v);
    }
  }
  vector<vector<int>> eq = {
    {1, 1, -1, -f[0][1]},
    {-1, 1, 1, -f[1][2]},
    {1, -1, 1, -f[0][2]},
  };
  vector feq(3, vector<long double>(4));
  for (int i = 0; i < 3; ++i) {
    for (int j = 0; j < 4; ++j) feq[i][j] = eq[i][j];
  }
  auto res = solve(feq);
  vector<int> eans(3);
  for (int i = 0; i < 3; ++i) eans[i] = res[i];
  int w3 = -eans[0] - eans[1] + eans[2] + f[2][3];
  int w4 = eans[0] - eans[1] - eans[2] + f[3][0];
  int w6 = -eans[0] + eans[1] - eans[2] + f[1][3];
  if (w3 != 0 || w4 != 0 || w6 != 0) {
    cout << -1;
    return 0;
  }
  for (int i = 0; i < 3; ++i) {
    add(i, (i + 1) % 4, (i + 2) % 4, (i + 3) % 4, eans[i]);
  }
  cout << ans.size() << '\n';
  for (auto [a, b, c, d, x] : ans) {
    cout << a + 1 << ' ' << b + 1 << ' ' << c + 1 << ' ' << d + 1 << ' ' << x << '\n';
  }
}