#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int msb(int x){
    for(int i = 29; i >= 0; i--){
        if(x&(1<<i)) return i;
    }
}

using T = tuple<int, int, int>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<int> a(n), b(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < n; i++) cin >> b[i];
    int m = 0;
    for(int i = 0; i < n; i++) chmax(m, msb(a[i]));
    for(int i = 0; i < n; i++) chmax(m, msb(b[i]));
    int a_msb = -1;
    for(int i = 0; i < n; i++){
        if(a[i]&(1<<m)){
            a_msb = i;
            break;
        }
    }
    vector<T> ans;
    auto push = [&](int t, int i, int j){
        if(t == 1) a[i] ^= b[j];
        else b[j] ^= a[i];
        ans.push_back(T(t, i, j));
    };
    if(a_msb == -1){
        int b_msb = -1;
        for(int i = 0; i < n; i++){
            if(b[i]&(1<<m)){
                b_msb = i;
                break;
            }
        }
        assert(b_msb != -1);
        push(1, 0, b_msb);
        a_msb = 0;
    }
    for(int i = 0; i < n; i++){
        if(b[i]&(1<<m)) continue;
        push(2, a_msb, i);
    }
    for(int i = 0; i < n; i++){
        if(a[i]&(1<<m)) {
            push(1, i, 0);
        }
    }
    // print_vector(a);
    // print_vector(b);
    cout << ans.size() << endl;
    for(auto [t, p, q]: ans) cout << t << ' ' << p+1 << ' ' << q+1 << endl;
}