// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn run() {
    input! {
        n: usize,
        a: [u32; n],
        b: [u32; n],
    }
    let mut a = a;
    let mut b = b;
    let mut ans = vec![];
    let x = (0..n).min_by_key(|&x| a[x].leading_zeros()).unwrap();
    let y = (0..n).min_by_key(|&x| b[x].leading_zeros()).unwrap();
    if a[x].leading_zeros() > b[y].leading_zeros() {
        ans.push((1, x, y));
        a[x] ^= b[y];
    }
    for i in 0..n {
        if b[i].leading_zeros() > a[x].leading_zeros() {
            ans.push((2, x, i));
            b[i] ^= a[x];
        }
    }
    for i in 0..n {
        if a[i].leading_zeros() == b[0].leading_zeros() {
            ans.push((1, i, 0));
            a[i] ^= b[0];
        }
    }
    assert!(a.iter().max().unwrap() < b.iter().min().unwrap());
    println!("{}", ans.len());
    for (op, a, b) in ans {
        println!("{} {} {}", op, a + 1, b + 1);
    }
}

fn main() {
    run();
}