#include <iostream>
#include <vector>

using namespace std;
typedef long long ll;
ll a[100010],b[100010],d[100010],p = 223577;
ll pw(ll a,ll x){
    ll ret = 1;
    while(x){
        if(x&1) (ret *= a) %= p;
        (a *= a) %= p; x /= 2;
    }
    return ret;
}

vector<pair<int,int>> ans;
void solve(int i,int j){
    ans.push_back({i,j});
    (a[i] += a[j]) %= p;
}

void fin(){
    for(int i=0;i<ans.size();i++){
        cout << 1 << " " << ans[i].first << " " << ans[i].second << endl;
    }
    cout << 2 << endl;
}

int main(){
    int i,n; cin >> n;
    for(i=0;i<n;i++) cin >> a[i];
    for(i=0;i<n;i++) cin >> b[i];
    bool f1 = false,f2 = false;
    for(i=0;i<n;i++){
        if(a[i]) f1 = true;
        if(b[i]) f2 = true;
    }
    if(!(f1^f2)){
        cout << -1 << endl;
        return 0;
    }
    cout << "Yes\n";
    if(!f1 && !f2){
        cout << 0 << endl;
        return 0;
    }
    vector<int> z1,z2;
    int j = -1,k = 0;
    for(i=0;i<n;i++){
        if(a[i]) z1.push_back(i);
        if(b[i]) z2.push_back(i);
    }
    if(z1.size()==1 && z2.size()==1 && z1[0]==z2[0]){
        j = z1[0];
        for(i=0;i<p;i++){
            if(a[j]!=b[j]) solve(j,j);
        }
        if(a[j]==b[j]) fin();
        else cout << -1 << endl;
        return 0;
    }
    j = z1[0],k = z2[0];
    if(j==k){
        if(z1.size()>1) j = z1[1];
        else k = z2[1];
    } 
    ll inv = pw(a[j],p - 2);
    for(i=0;i<n;i++){
        (a[i] *= inv) %= p; (b[i] *= inv) %= p;
    }
    if(a[k]>b[k]) a[k] -= p;
    ll dif = b[k] - a[k];
    while(dif){
        if(dif&1) solve(k,j);
        solve(j,j); dif /= 2;
    }
    ll inv2 = pw(a[k],p - 2);
    for(i=0;i<n;i++){
        (a[i] *= inv2) %= p;
        (b[i] *= inv2) %= p;
        d[i] = b[i] - a[i];
        if(d[i]<0) d[i] += p;
    }
    for(j=0;j<20;j++){
        bool f = true;
        for(i=0;i<n;i++){
            if(d[i]) f = false;
            if(d[i]&1){
                solve(i,k); d[i] /= 2;
            }
        }
        if(f) break;
        solve(k,k);
    }
    for(i=0;i<p;i++){
        if(a[k]==b[k]) continue;
        solve(k,k);
    }
    fin();
}