import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
#from math import isqrt, prod, comb  #python3.8用(notpypy)
#from bisect import bisect_left, bisect_right
#from functools import lru_cache, reduce
#from heapq import heappush, heappop, heapify, heappushpop, heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)

def main():
    mod = 10**9+7
    mod2 = 998244353
    n=int(input())
    A=list(map(int, input().split()))+[10**10]
    B=list(map(int, input().split()))+[10**10]
    RL=[int(AA>BB) for AA,BB in zip(A,B)]
    now=0
    mid=0
    ans=[]
    l=0
    for i in range(n+1):
        if RL[i]==1:
            if now==0:
                mid=i
                now=1
        elif RL[i]==0:
            if now==1:
                for j in range(mid,i):
                    ans.extend([f'{j+1} L']*(A[j]-B[j]))
                for j in range(l,mid)[::-1]:
                    ans.extend([f'{j+1} R']*(B[j]-A[j]))
                l=i
                now=0
    for j in range(l,n)[::-1]:
        ans.extend([f'{j+1} R']*(B[j]-A[j]))
    #print(RL)
    print(len(ans))
    for a in ans:
        print(a)
            
    



if __name__ == '__main__':
    main()