import sys
sys.setrecursionlimit(10**7)

def dfs(i):
    while A[i] != B[i]:
        if A[i] > B[i]:
            ans.append((i, "L"))
            A[i] -= 1
        else:
            if A[i + 1] == A[i] + 1:
                dfs(i + 1)
            else:
                ans.append((i, "R"))
                A[i] += 1
    return 


N = int(input())
A = list(map(int, input().split())) + [10 ** 18]
B = list(map(int, input().split()))

ans = []
for i in range(N):
    dfs(i)
print(len(ans))
for k, c in ans:
    print(k + 1, c)