#include<bits/stdc++.h>
#define MAXN 1000001
#define LOGN 21
using namespace std;
int a[MAXN],n,b[MAXN];
int br[LOGN],br1[LOGN];
int ch=0;
struct operat{
    int type,ind,num;
};
operat ops[MAXN];
int chis[MAXN];
int main(){
    freopen("homework.in","r",stdin);
    freopen("homework.out","w",stdout);
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    for(int i=0;i<n;i++){
        cin>>b[i];
    }
    int ind=0;
    for(int i=0;i<LOGN;i++){
        int a0=-1,a1=-1,b0=-1,b1=-1,razI=-1;
        for(int i1=0;i1<n;i1++){
            if((a[i1]&(1<<i))!=0){
                br[i]++;
                if(a1==-1) a1=i;
            }else if(a0==-1) a0=i;
            if((b[i1]&(1<<i))!=0){
                br1[i]++;
                if(b1==-1) b1=i;
            }else b0=i;
            if((a[i1]&(1<<i))!=(b[i1]&(1<<i))) razI=i1;
        }
        if(br[i]==n && br1[i]!=n || br1[i]==n && br[i]!=n){
            if(n%2!=min(br1[i],br[i])%2){
                ops[ind].type=1;
                if(min(br1[i],br[i])==0) ch^=(1<<i);
                ops[ind].ind=razI;
                ops[ind].num=(((1<<LOGN)-1)^(1<<i));
            }else{
                ops[ind].type=3;
                ops[ind].ind=razI;
                ops[ind].num=(1<<i);
            }
            ind++;

        }else if(br[i]==0 && br1[i]!=0 || br1[i]==0 && br[i]!=0){
            if(max(br1[i],br[i])%2!=0){
                ops[ind].type=2;
                if(min(br1[i],br[i])==0) ch^=(1<<i);
                ops[ind].ind=razI;
                ops[ind].num=(1<<i);
            }else{
                ops[ind].type=3;
                ops[ind].ind=razI;
                ops[ind].num=(1<<i);
            }
            ind++;
        }else{
            if(br[i]%2!=br1[i]%2){
                if(br[i]!=n-1 && br1[i]!=n-1){
                    ops[ind].type=2;
                    ops[ind].ind=razI;
                    ops[ind].num=(1<<i);
                }else{
                    ops[ind].type=1;
                    ops[ind].ind=razI;
                    ops[ind].num=(((1<<LOGN)-1)^(1<<i));
                }
                ind++;
            }
        }
    }
    bool da=false;
    for(int i=0;i<ind;i++){

        if(ops[i].type==1 && br[ops[i].ind]!=0){
            ops[br[ops[i].ind]].num&=ops[i].num;
            ops[i].type=3;
            ops[i].ind=1;
            ops[i].num=ch;
            da=true;
            break;
        }else {
            br[ops[i].ind]=i;
        }

    }
    if(!da){
        for(int i=0;i<ind;i++){
            if(ops[i].type==2 && br[ops[i].ind]!=0){
                ops[br[ops[i].ind]].num|=ops[i].num;
                ops[i].type=3;
                ops[i].ind=1;
                ops[i].num=ch;
                da=true;
                break;
            }else {
                br[ops[i].ind]=i;
            }
        }
    }
    if(!da){
        for(int i=0;i<ind;i++){
            if(ops[i].type==3){
                ops[i].num^=ch;
                da=true;
                break;
            }
        }
    }
    cout<<ind<<"\n";
    for(int i=0;i<ind;i++){
        cout<<ops[i].type<<" "<<ops[i].ind+1<<" "<<ops[i].num<<"\n";
    }
}