import sys
INF = float('inf')
#10**20,2**63,float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
#from collections import defaultdict
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(input())
    def IC(): return [int(c) for c in input()]
    def MI(): return map(int, sys.stdin.readline().split())
    N = II()
    A = LI()
    B = LI()
    Go = [[0,0] for _ in range(N)]
    for n in range(N):
        if A[n] < B[n]:
            Go[n][0] = "R"
            Go[n][1] = B[n]-A[n]
        elif A[n] > B[n]:
            Go[n][0] = "L"
            Go[n][1] = A[n] - B[n]
    #print(Go)
    i = 0
    from collections import deque
    Ope = deque()
    Num = 0
    Out = []
    while i < N:
        if Go[i][0] == "R":
            Ope.appendleft((i+1,"R",Go[i][1]))
        elif Go[i][0] == "L":
            while Ope:
                tmp = Ope.popleft()
                for _ in range(tmp[2]):
                    Num += 1
                    Out.append((tmp[0],tmp[1]))
                    #print(tmp[0],tmp[1])
            for _ in range(Go[i][1]):
                Num += 1
                Out.append((i+1,"L"))
        else:
            while Ope:
                tmp = Ope.popleft()
                for _ in range(tmp[2]):
                    Num += 1
                    Out.append((tmp[0],tmp[1]))
                    #print(tmp[0],tmp[1])
        i+=1
    while Ope:
        tmp = Ope.popleft()
        for _ in range(tmp[2]):
            Num += 1
            Out.append((tmp[0], tmp[1]))
            # print(tmp[0],tmp[1])
    print(Num)
    for out in Out:
        print(*out)
    return
solve()
#sys.setrecursionlimit(10 ** 6)#再帰関数ではコメントにしないこと！！