#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<int> a(n);
    vector<int> b(n);
    int bit = 0;
    for(int i=0;i<n;i++){
        cin >> a[i];
        for(int j=bit;j<30;j++){
            if((1<<j)&a[i]){
                bit = j;
            }
        }
    }
    for(int i=0;i<n;i++){
        cin >> b[i];
        for(int j=bit;j<30;j++){
            if((1<<j)&b[i]){
                bit = j;
            }
        }
    }
    vector<pair<int,int>> v;
    int aa = -1, bb = -1;
    for(int i=0;i<n;i++){
        if((1<<bit)&a[i]) aa = i;
        if((1<<bit)&b[i]) bb = i;
    }
    if(aa == -1){
        v.push_back({1, -(bb+1)});
        a[0] ^= b[bb];
        aa = 0;
    }
    for(int i=0;i<n;i++){
        if((1<<bit)&b[i])continue;
        v.push_back({-(aa+1), i+1});
        b[i] ^= a[aa];
    }
    for(int i=0;i<n;i++){
        if((1<<bit)&a[i]){
            v.push_back({i+1, -1});
        }
    }
    cout << v.size() << "\n";
    for(auto p:v){
        cout << (p.first<0)+1 << " ";
        cout << abs(p.first) << " " << abs(p.second) << "\n";
    }
}