#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
void query(int t, int p, int q, vector<int>& a, vector<int>& b, vector<vector<int>>& ans){
    vector<int> temp;
    temp.push_back(t);
    temp.push_back(p + 1);
    temp.push_back(q + 1);
    if(t == 1) a[p] = a[p] ^ b[q];
    if(t == 2) b[q] = a[p] ^ b[q];
    ans.push_back(temp);
}

void swap(int i, int j, vector<int>& a, vector<int>& b, vector<vector<int>>& ans){
    //a[i] と b[j] を交換
    query(1, i, j, a, b, ans);
    query(2, i, j, a, b, ans);
    query(1, i, j, a, b, ans);
}
int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    vector<int> b(n);
    rep(i, n) cin >> a[i];
    rep(i, n) cin >> b[i];
    vector<vector<int>> ans;
    int maxa = 0, maxb = 0;
    rep(i, n){
        if(a[i] > maxa) maxa = a[i];
        if(b[i] > maxb) maxb = b[i];
    }
    int now;
    if (maxa > maxb){
        rep(i, n) if (a[i] == maxa){
         now = i;
         break;
        }
    }

    else{
        rep(i, n) if (b[i] == maxb){
            swap(0, i, a, b, ans);
            now = 0;
            break;
        }
    }
    int k = 0;
    rep(i, 30){
        if (1 & (a[now] >> i)) k = i;
    }
    cout << k << endl;
    rep(i,n){
        if (b[i] < 1 << k){
            query(2, now, i, a, b, ans);
        }
    }
    rep(i, n){
        if (1 & (a[i] >> k)){
            query(1, i, 0, a, b, ans);
        }
    }
    int ans1 = ans.size();
    cout << ans1 << endl;
    rep(i, ans1){
        printf("%d %d %d\n" ,ans[i][0], ans[i][1], ans[i][2]);
    }
    
    return 0;
}