import java.util.*; import java.io.*; class Tuple { int id, a, b; Tuple(int id, int a, int b){ this.id = id; this.a = a; this.b = b; } } public class Main { static final int INF = 1<<30; static final long INFL = 1L<<60; static final int MOD = 1000000007; static final int MOD2 = 998244353; static List> g; public static void main(String[] args) { FastScanner fs = new FastScanner(); PrintWriter pw = new PrintWriter(System.out); // .#.#..## // ..####.. int n = fs.nextInt(); int[] a = fs.nextInts(n); int[] b = fs.nextInts(n); Arrays.sort(a); Arrays.sort(b); long ans = 0; for(int i = 0; i < n; i++){ ans += Math.abs(a[i]-b[i]); } pw.println(ans); Queue que = new ArrayDeque<>(); for(int i = 0; i < n; i++){ if(a[i] != b[i]) que.add(i); } while(!que.isEmpty()){ int now = que.poll(); while(a[now] < b[now] && (now == n-1 || a[now+1] != a[now]+1)){ a[now]++; pw.println((now+1) + " R"); } while(a[now] > b[now] && (now == 0 || a[now-1] != a[now]-1)){ a[now]--; pw.println((now+1) + " L"); } if(a[now] == b[now] && n != 1) { if(now == 0 && a[now+1] != b[now+1]) que.add(now+1); else if(now == n-1 && a[now-1] != b[now-1]) que.add(now-1); else if(now != 0 && now != n-1){ if(a[now-1] != b[now-1]) que.add(now-1); if(a[now+1] != b[now+1]) que.add(now+1); } } } pw.close(); } } class FastScanner { private InputStream in = System.in; private byte[] buffer = new byte[1024]; private int length = 0, p = 0; private boolean hasNextByte() { if (p < length) return true; else{ p = 0; try{ length = in.read(buffer); }catch(Exception e){ e.printStackTrace(); } if(length == 0) return false; } return true; } private int readByte() { if (hasNextByte() == true) return buffer[p++]; return -1; } private static boolean isPrintable(int n) { return 33 <= n && n <= 126; } private void skip() { while (hasNextByte() && !isPrintable(buffer[p])) p++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int temp = readByte(); while (isPrintable(temp)) { sb.appendCodePoint(temp); temp = readByte(); } return sb.toString(); } public int nextInt() { return Math.toIntExact(nextLong()); } public int[] nextInts(int n) { int[] ar = new int[n]; for (int i = 0; i < n; i++) ar[i] = nextInt(); return ar; } public long[] nextLongs(int n) { long[] ar = new long[n]; for (int i = 0; i < n; i++) ar[i] = nextLong(); return ar; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); boolean minus = false; int temp = readByte(); if (temp == '-') { minus = true; temp = readByte(); } if (temp < '0' || '9' < temp) throw new NumberFormatException(); long n = 0; while (isPrintable(temp)) { if ('0' <= temp && temp <= '9') { n *= 10; n += temp - '0'; } temp = readByte(); } return minus ? -n : n; } public char[] nextChars() { String s = next(); return s.toCharArray(); } public char[][] nextCharMat(int h, int w) { char[][] ar = new char[h][w]; for(int i = 0; i < h; i++){ String s = next(); for(int j = 0; j < w; j++){ ar[i][j] = s.charAt(j); } } return ar; } }