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

c=sorted(a+b)
b_min=c[n]
operation=[]

cnt=2*n
for i in range(2*n):
  if c[i]==b_min:
    cnt=min(i,cnt)

cnt=n-cnt

idx=-1
for i in range(n):
  if a[i]==b_min:
    idx=i

if idx==-1:
  idx2=-1
  for i in range(n):
    if b[i]==b_min:
      idx2=i
  operation.append((1,0,idx2))
  operation.append((2,0,idx2))
  operation.append((1,0,idx2))
  b[idx2],a[0]=a[0],b[idx2]
  idx=0

for i in range(n):
  if b[i]==b_min:
    if cnt>0:
      operation.append((2,idx,i))
      a[i]=0
      cnt-=1

idx=-1
for i in range(n):
  if b[i]==b_min:
    idx=i

if idx==-1:
  idx2=-1
  for i in range(n):
    if a[i]==b_min:
      idx2=i
  operation.append((2,idx2,0))
  operation.append((1,idx2,0))
  operation.append((2,idx2,0))
  a[idx2],b[0]=b[0],a[idx2]
  idx=0

for i in range(n):
  if a[i]==b_min:
    if cnt>0:
      operation.append((1,i,idx))
      a[i]=0
      cnt-=1

hq1=[]
for i in range(n):
  heapq.heappush(hq1,(-a[i],i))

hq2=[]
for i in range(n):
  heapq.heappush(hq2,(b[i],i))

while -hq1[0][0]>b_min:
  x,p=heapq.heappop(hq1)
  y,q=heapq.heappop(hq2)
  operation.append((1,p,q))
  operation.append((2,p,q))
  operation.append((1,p,q))
  a[p],b[q]=b[q],a[p]

print(len(operation))
for t,p,q in operation:
  print(t,p+1,q+1)