n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans =  []
max_a = max(A)
l = max_a.bit_length() - 1
ind = A.index(max_a) + 1
for i in range(n):
    if not B[i] >> l & 1:
        ans.append((2, ind, i + 1))
        B[i] ^= max_a
        
min_b = min(B)
l = min_b.bit_length() - 1
ind = B.index(min_b) + 1
for i in range(n):
    if A[i] >> l & 1:
        ans.append((1, i + 1, ind))
        A[i] ^= min_b

print(len(ans))
for row in ans:
    print(*row)
    
assert max(A) < min(B)