using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        var b = NList;
        var ans = Xor(n, a, b);
        WriteLine(ans.Count);
        if (ans.Count > 0) WriteLine(string.Join("\n", ans));
    }
    static List<string> Xor(int n, int[] a, int[] b)
    {
        var bits = 0;
        for (var i = 0; i < n; ++i)
        {
            bits = Math.Max(bits, Bits(a[i]));
            bits = Math.Max(bits, Bits(b[i]));
        }
        var abit = new int[n];
        var bbit = new int[n];
        for (var i = 0; i < n; ++i)
        {
            abit[i] = (a[i] >> bits - 1) & 1;
            bbit[i] = (b[i] >> bits - 1) & 1;
        }
        var apos = -1;
        var bpos = -1;
        for (var i = 0; i < n; ++i)
        {
            if (abit[i] == 1) apos = i;
            if (bbit[i] == 1) bpos = i;
        }
        var ans = new List<string>();
        if (apos < 0)
        {
            ans.Add($"1 {n} {bpos + 1}");
            apos = n - 1;
            abit[n - 1] = 1;
        }
        if (bpos < 0)
        {
            ans.Add($"2 {apos + 1} {n}");
            bpos = n - 1;
            bbit[n - 1] = 1;
        }
        for (var i = 0; i < n; ++i)
        {
            if (i != apos && abit[i] == 1)
            {
                ans.Add($"1 {i + 1} {bpos + 1}");
            }
            if (i != bpos && bbit[i] == 0)
            {
                ans.Add($"2 {apos + 1} {i + 1}");
            }
        }
        ans.Add($"1 {apos + 1} {bpos + 1}");
        return ans;
    }
    static bool Check(int n, int[] _a, int[] _b, List<string> ans)
    {
        var a = _a.ToArray();
        var b = _b.ToArray();
        foreach (var q in ans)
        {
            var c = q.Split();
            var kind = int.Parse(c[0]);
            var x = int.Parse(c[1]) - 1;
            var y = int.Parse(c[2]) - 1;
            if (kind == 1)
            {
                a[x] ^= b[y];
            }
            else
            {
                b[y] ^= a[x];
            }
        }
        return a.Max() < b.Min();
    }
    static int Bits(int n)
    {
        var ans = 0;
        while (n > 0)
        {
            ++ans;
            n >>= 1;
        }
        return ans;
    }
}