#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    priority_queue<P> a;
    priority_queue<P,vector<P>,greater<P>> b;
    rep(i,n){
        ll x;
        cin >> x;
        a.push({x,i+1});
    }
    rep(i,n){
        ll x;
        cin >> x;
        b.push({x,i+1});
    }
    vector<vector<ll>> ans;
    int cnt = 0;
    vector<ll> sub(3);
    while(a.top().first>=b.top().first){
        cnt++;
        ll p1,p2,q1,q2;
        tie(p1,p2) = a.top(); tie(q1,q2) = b.top();
        ll x = p1^q1;
        if(x>p1){
            sub = {2,p2,q2};
            b.pop();
            b.push({x,q2});
        }else{
            sub = {1,p2,q2};
            a.pop();
            a.push({x,p2});
        }
        ans.push_back(sub);
    }
    cout << cnt << '\n';
    rep(i,cnt){
        rep(j,3) cout << ans[i][j] << " ";
        cout << '\n';
    }
    while(cnt>10000) cnt++;
    return 0;
}