package main

import . "fmt"
import . "os"
import bf "bufio"

func main() {
	rd:=bf.NewReader(Stdin)
	wr:=bf.NewWriter(Stdout)
	defer wr.Flush()
	
	var n int
	Fscan(rd,&n)
	
	aa := make([]int, n)
	for i := range aa {
		Fscan(rd,&aa[i])
	}
	
	cnt := 0
	bb := make([]int, n)
	for i := range bb {
		Fscan(rd,&bb[i])
		d := bb[i]-aa[i]
		cnt += max(d,-d)
	}
	
	Fprintln(wr, cnt)
	
	cur := 0
	stack := []int{}
	for cnt > 0 {
		switch {
			case aa[cur] < bb[cur]:
				if cur+1==n || aa[cur]+1<aa[cur+1] {
					cnt--
					Fprintln(wr, cur+1, "R")
					aa[cur]++
				} else {
					stack = append(stack, cur)
					cur++
				}
			case aa[cur] > bb[cur]:
				cnt--
				Fprintln(wr, cur+1, "L")
				aa[cur]--
			default:
				if sn := len(stack); sn > 0 {
					cur = stack[sn-1]
					stack = stack[:sn-1]
				} else {
					cur++
				}
		}
	}
	
}