def solve(n, a, b):
    ans = []
    c = sorted(a + b)
    minb = c[n]
    while minb in c[0:n] and a.count(minb) > 1:
        q = b.index(minb)
        p = a.index(max(a))
        ans.append((1, p + 1, q + 1))
        ans.append((2, p + 1, q + 1))
        a[p], b[q] = b[q], a[p]
    
    
    while max(a) >= min(b):
        p = a.index(max(a))
        q = b.index(min(b))
        ans.append((1, p + 1, q + 1))
        if max(a) > max(b):
            ans.append((2, p + 1, q + 1))
            ans.append((1, p + 1, q + 1))
            a[p], b[q] = b[q], a[p]
        else:
            a[p] = 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)