from collections import deque

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

L = [deque() for _ in range(n)]
for i in range(n - 1, -1, -1):
    if A[i] < B[i]:
        cnt = B[i] - A[i]
        for j in range(cnt):
            L[i].append((i + 1, 'R'))
    elif A[i] > B[i]:
        cnt = A[i] - B[i]
        for j in range(cnt):
            L[i].append((i + 1, 'L'))

ANS = []
flag = True
while flag:
    flag = False
    for i in range(n):
        if L[i]:
            if L[i][0][1] == 'R':
                if i < n - 1 and A[i] + 1 == A[i + 1]:
                    continue
                ANS.append(L[i].popleft())
                A[i] += 1
            elif L[i][0][1] == 'L':
                if i > 0 and A[i] - 1 == A[i - 1]:
                    continue
                ANS.append(L[i].popleft())
                A[i] -= 1
            flag = True

print(len(ANS))
for ind, direction in ANS:
    print(ind, direction)