def solve(n, a, b):
    ans = []
    while max(a) > min(b):
        p = a.index(max(a))
        q = b.index(min(b))
        ans.append((1, p + 1, q + 1))
        ans.append((2, p + 1, q + 1))
        ans.append((1, p + 1, q + 1))
        a[p], b[q] = b[q], a[p]
    for i in range(n):
        if a[i] in b:
            q = b.index(a[i])
            ans.append((1, i + 1, q + 1))
            a[i] = 0
    return ans

n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))

ans = solve(n, a, b)
print(len(ans))

for t, i, j in ans:
    print(t, i, j)