from heapq import *
from collections import deque

N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
A.sort()
for i in range(N):
  A[i] = (-A[i],'A',i+1)
B.sort()
for i in range(N):
  B[i] = (-B[i],'B',i+1)
C = A+B
C.sort()
ans_list = []
la,lb = 0,0
que_a,que_b = deque([]),deque([])

while C:
  n1,c1,i1 = heappop(C)
  n2,c2,i2 = heappop(C)
  n1 *= -1
  n2 *= -1
  if c1 != c2:
    s = ''
    i = 0
    num = abs(n1-n2)
    if c1 == 'A':
      i = i1
      if n1 < n2:
        s = 'R'
      if n1 > n2:
        s = 'L'
    if c1 == 'B':
      i = i2
      if n1 < n2:
        s = 'L'
      if n1 > n2:
        s = 'R'
    if s != '':
      for _ in range(num):
        ans_list.append((i,s))
  else:
    if c1 == 'A':
      que_a.append((n1,i1))
      que_a.append((n2,i2))
      la += 2
    else:
      que_b.append((n1,i1))
      que_b.append((n2,i2))
      lb += 2
    
    if la == lb:
      while que_a:
        if que_a[-1][0] > que_b[-1][0]:
          n1,i1 = que_a.pop()
          n2,i2 = que_b.pop()
        else:
          n1,i1 = que_a.popleft()
          n2,i2 = que_b.popleft()
        num = abs(n1-n2)
        s = ''
        if n1 < n2:
          s = 'R'
        else:
          s = 'L'
        for _ in range(num):
          ans_list.append((i1,s))


print(len(ans_list))
for x,y in ans_list:
  print(x,y)