/*made in mrd*/
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
#define endl '\n'
#define int long long
#define mem(a,b) memset(a,b,sizeof a)
#define fi first
#define se second
#define lu u<<1
#define ru u<<1|1
#define pb push_back
#define bug1(x) cout<<x<<endl
#define bug2(x,y) cout<<x<<' '<<y<<endl
#define pii pair<int,int>
#define bug3(x,y,z) cout<<x<<' '<<y<<' '<<z<<endl
void init()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
int n;
int a[N];
int b[N];
struct node{
    int a,b,c;
};
vector<node>ans;
priority_queue<pii>q,p;
signed main() {
    init();
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        q.push({a[i],i});
    }
    for(int i=1;i<=n;i++){
        cin>>b[i];
        p.push({-b[i],i});
    }
    int t=100;
    while(1)
    {
        auto x=q.top();
        q.pop();
        auto y=p.top();
        p.pop();
        int x1=x.fi;
        int y1=-y.fi;
        //cout<<x1<<" "<<y1<<endl;
        if(x1<y1) break;
        int z=(x1^y1);
        if(z<x1){
        //cout<<z<<endl;
        //cout<<q.top().fi<<endl;
            q.push({z,x.se});
            p.push({-y1,y.se});
            ans.pb({1,x.se,y.se});
        }
        else {
            q.push({x1,x.se});
            p.push({-z,y.se});
            ans.pb({2, x.se, y.se});
        }
    }
    cout<<ans.size()<<endl;
    for(auto i:ans){
        cout<<i.a<<" "<<i.b<<" "<<i.c<<endl;
    }
    return 0;
}