#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include <tuple>
#define i128 __int128
#define i64 long long
#define uit unsigned int
#define ull unsigned i64
#define tp3 tuple<int,int,int>
template <class T> bool chkmax(T &x,T y){ return x<y?x=y,true:false; }
template <class T> bool chkmin(T &x,T y){ return x>y?x=y,true:false; }
using namespace std;
namespace io{
    #define file(s,x)\
        freopen(#s#x".in","r",stdin);\
        freopen(#s".out","w",stdout);
    const int SIZE=1<<21;
    short plc[50],rof=0;
    char ibuf[SIZE],*p1=ibuf,*p2=ibuf,obuf[SIZE],*p3=obuf;
    #define flush() (fwrite(obuf,1,p3-obuf,stdout),p3=obuf)
    #define gc() (p1==p2&&(p2=(p1=ibuf)+fread(ibuf,1,SIZE,stdin),p1==p2)?EOF:*p1++)
    #define pc(ch) (p3==obuf+SIZE&&flush(),*p3++=ch)
    class Flush{ public: ~Flush(){ flush(); } }_;
    template <class T> inline void read(T &x){
        x=0; bool flag=true; char c=gc();
        while(!isdigit(c)){ if(c=='-') flag=false; c=gc(); }
        while(isdigit(c)){ x=(x<<1)+(x<<3)+(c^48); c=gc(); }
        !flag&&(x=~(x-1));
    }
    inline void read(char &c){ while((c=gc())<'a'||c>'z'); }
    inline void read(string &s){
        s=""; char c; while((c=gc())<'a'||c>'z') ;
        s+=c; while((c=gc())>='a'&&c<='z') s+=c;
    }
    template <class T,class ...Args>
    inline void read(T &first,Args &...args){
        read(first);
        read(args...);
    }
    template <class T> inline void print(T x){
        x<0?pc('-'),x=-x:0;
        do plc[++rof]=x%10; while(x/=10);
        while(rof) pc(plc[rof--]|48);
    }
    inline void print(char c){ pc(c); }
    inline void print(string s){ for(char c : s) pc(c); }
    inline void print(const char *s){ print(string(s)); }
    template <class T,class ...Args>
    inline void print(T first,Args ...args){
        print(first);
        print(args...);
    }
}
using namespace io;
const int N=105;
int n,a[N][N];
int b[10][10];
int sum,tot;
bool use[6];
int nod[6][5]={
    {0,0,0,0,0},
    {0,2,3,4,5},
    {0,1,3,4,5},
    {0,1,2,4,5},
    {0,1,2,3,5},
    {0,1,2,3,4}
};
struct Answer{
    int a,b,c,d,x;
    void out(){
        print(a,' ',b,' ',c,' ',d,' ',x,'\n');
    }
};
vector<Answer>ans;
bool GJ(){
    for(int i=1;i<=4;i++){
        int tmp=i;
        for(int j=i;j<=6;j++)
            if(b[j][i]){
                tmp=j;
                break;
            }
        if(tmp!=i)
            swap(b[tmp],b[i]);
        if(!b[i][i]) continue;
        for(int k=1;k<=6;k++){
            if(k==i) continue;
            for(int j=5;j>=i;j--)
                b[k][j]-=b[k][i]*b[i][j]/b[i][i];
        }
    }
    if(b[5][5]||b[6][5])
        return false;
    for(int i=1;i<=4;i++)
        if(!b[i][i]&&b[i][5])
            return false;
        else if(b[i][i])
            b[i][5]/=b[i][i];
    return true;
}
tp3 mex(int i,int j,int k){
    int x=1,y=1,z=1;
    while(x==i||x==j||x==k) x++;
    while(y==i||y==j||y==k||y==x) y++;
    while(z==i||z==j||z==k||z==x||z==y) z++;
    return make_tuple(x,y,z);
}
#define t(_) nod[tmp][_]
void dfs(int tmp){
    if(!tot){
        for(int i=1;i<=5;i++){
            if(!use[i]) continue;
            ans.push_back({
                nod[i][1],
                nod[i][2],
                nod[i][3],
                nod[i][4],
            1});
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(i==j||!a[i][j])
                    continue;
                int k=j+1==i?i+1:j+1;
                if(k>n) continue;
                auto [x,y,z]=mex(i,j,k);
                ans.push_back({x,i,y,j,-a[i][j]/2});
                ans.push_back({x,i,y,k,a[i][j]/2});
                ans.push_back({j,i,k,x,a[i][j]/2});
                ans.push_back({j,i,y,k,-a[i][j]/2});
                ans.push_back({y,i,x,j,-a[i][j]/2});
                ans.push_back({y,i,x,k,a[i][j]/2});
                ans.push_back({j,i,k,y,a[i][j]/2});
                ans.push_back({j,i,x,k,-a[i][j]/2});
                a[i][k]+=a[i][j];
                a[k][i]+=a[i][j];
                a[i][j]=a[j][i]=0;
            }
        }
        print(ans.size(),'\n');
        for(auto it : ans)
            it.out();
        exit(0);
    }
    if(tmp>5) return;
    dfs(tmp+1);
    use[tmp]=true;
    for(int i=2;i<=4;i++){
        a[t(1)][t(i)]--;
        a[t(i)][t(1)]--;
        tot+=a[t(1)][t(i)]&1?1:-1;
    }
    for(int i=2;i<4;i++){
        for(int j=i+1;j<=4;j++){
            a[t(i)][t(j)]++;
            a[t(j)][t(i)]++;
            tot+=a[t(i)][t(j)]&1?1:-1;
        }
    }
    dfs(tmp+1);
    use[tmp]=false;
    for(int i=2;i<=4;i++){
        a[t(1)][t(i)]++;
        a[t(i)][t(1)]++;
        tot+=a[t(1)][t(i)]&1?1:-1;
    }
    for(int i=2;i<4;i++){
        for(int j=i+1;j<=4;j++){
            a[t(i)][t(j)]--;
            a[t(j)][t(i)]--;
            tot+=a[t(i)][t(j)]&1?1:-1;
        }
    }
}
int main(){
    // file(qoj,);
    read(n);
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            read(a[i][j]);
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            int x; read(x);
            a[i][j]=x-a[i][j];
            sum+=a[i][j];
        }
    }
    if(sum)
        return print("-1\n"),0;
    if(n==4){
        b[1][1]=b[1][2]=1,b[1][3]=b[1][4]=-1,b[1][5]=a[1][2];
        b[2][1]=b[2][3]=1,b[2][2]=b[2][4]=-1,b[2][5]=a[1][3];
        b[3][1]=b[3][4]=1,b[3][2]=b[3][3]=-1,b[3][5]=a[1][4];
        b[4][2]=b[4][3]=1,b[4][1]=b[4][4]=-1,b[4][5]=a[2][3];
        b[5][2]=b[5][4]=1,b[5][1]=b[5][3]=-1,b[5][5]=a[2][4];
        b[6][3]=b[6][4]=1,b[6][1]=b[6][2]=-1,b[6][5]=a[3][4];
        if(!GJ()) return print("-1\n"),0;
        print("4\n");
        print("1 2 3 4 ",b[1][5],'\n');
        print("2 1 3 4 ",b[2][5],'\n');
        print("3 1 2 4 ",b[3][5],'\n');
        print("4 1 2 3 ",b[4][5],'\n');
    } else if(n==5){
        for(int i=2;i<=n;i++)
            for(int j=1;j<i;j++){
                a[i][j]=a[j][i];
                tot+=a[i][j]&1;
            }
        dfs(1),print("-1\n");
    } else{
        for(int i=2;i<=n;i++)
            for(int j=1;j<i;j++)
                a[i][j]=a[j][i];
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(i==j||!a[i][j])
                    continue;
                int k=j+1==i?i+1:j+1;
                if(k>n) continue;
                auto [x,y,z]=mex(i,j,k);
                ans.push_back({x,i,y,j,-a[i][j]});
                ans.push_back({j,i,z,x,a[i][j]});
                ans.push_back({j,i,y,z,-a[i][j]});
                ans.push_back({x,i,y,k,a[i][j]});
                ans.push_back({k,i,z,x,-a[i][j]});
                ans.push_back({k,i,y,z,a[i][j]});
                a[i][k]+=a[i][j];
                a[k][i]+=a[i][j];
                a[i][j]=a[j][i]=0;
            }
        }
        print(ans.size(),'\n');
        for(auto it : ans)
            it.out();
    }
    return 0;
}