def check(n,a,b,ans):
    for t,p,q in ans:
        if t==1:
            a[p]=a[p]^b[q]
        else:
            b[q]=a[p]^b[q]
    print(a)
    print(b)
    return max(a)<min(b)
def solv(n,a,b):
    import numpy as np
    ans=[]
    q=np.argmax(a)
    bit=1 # a[q]の最上位bit
    while bit<=a[q]:bit<<=1
    bit>>=1
    for i in range(n):
        if bit^b[i]>b[i]:
            ans.append([2,q,i])
    q=np.argmin(b)
    for i in range(n):
        if bit^a[i]<a[i]:
            ans.append([1,i,q])
    return ans

n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=solv(n,a,b)
#print(check(n,a,b,ans))
print(len(ans))
for t,p,q in ans:
    print(t,p+1,q+1)