#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint =  modint1000000007;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}
template<class T> T power(T x, ll y){if (y == 0) return 1;T p = pow(x,y/2);if (y%2 == 0) return p*p;else return p*p*x;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    vector<int> A(n), B(n);
    rep(i,n) cin >> A[i];
    rep(i,n) cin >> B[i];
    int c = -1;
    rep(i,n){
        rep(j,30){
            if (A[i]>>j&1) chmax(c,j);
            if (B[i]>>j&1) chmax(c,j);
        }
    }
    vector<bool> af(n), bf(n);
    int ai = -1, bi = -1;
    rep(i,n){
        af[i] = (A[i]>>c&1);
        bf[i] = (B[i]>>c&1);
        if (af[i]) ai = i;
        if (bf[i]) bi = i;
    }
    vector<tuple<int,int,int>> v;
    if (ai == -1){
        v.push_back(make_tuple(1,1,bi+1));
        rep(i,n){
            if (!bf[i]) v.push_back(make_tuple(2,1,i+1));
        }
        v.push_back(make_tuple(1,1,bi+1));
    }
    else if (bi == -1){
        rep(i,n) v.push_back(make_tuple(2,ai+1,i+1));
        rep(i,n) if (af[i]) v.push_back(make_tuple(1,i+1,1));
    }
    else{
        rep(i,n){
            if (!bf[i]) v.push_back(make_tuple(2,ai+1,i+1));
        }
        rep(i,n){
            if (af[i]) v.push_back(make_tuple(1,i+1,bi+1));
        }
    }
    cout << v.size() << endl;
    for (auto [t,p,q]:v) cout << t << " " << p << " " << q << endl;
}