import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

N=int(readline())
A=list(map(int,readline().split()))
B=list(map(int,readline().split()))
print(sum(abs(a-b) for a,b in zip(A,B)))
for i in range(N-1,-1,-1):
    if A[i]<B[i]:
        for _ in range(B[i]-A[i]):
            print(i+1,"R")
for i in range(N):
    if A[i]>B[i]:
        for _ in range(A[i]-B[i]):
            print(i+1,"L")