# import pypyjit
# pypyjit.set_param("max_unroll_recursion=-1")
from collections import *
from functools import *
from itertools import *
from heapq import *
import sys, math
# sys.setrecursionlimit(10**4)
# input = sys.stdin.readline

N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))

R = deque()
L = deque()
I = [0]*N
for i,(a,b) in enumerate(zip(A,B)):
    if a<b:
        R.append(i)
        I[i] = 1
    else:
        L.append(i)
X = []
while R:
    x = R.pop()
    d = B[x]-A[x]
    for _ in range(d):
        X.append((x+1,'R'))

while L:
    x = L.popleft()
    d = A[x]-B[x]
    for _ in range(d):
        X.append((x+1,'L'))
print(len(X))
for x,y in X:
    print(x,y)