/* -*- coding: utf-8 -*-
 *
 * 1650.cc:  No.1650 Moving Coins - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;

/* typedef */

typedef stack<int> sti;

/* global variables */

int as[MAX_N], bs[MAX_N], vs[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", as + i);
  for (int i = 0; i < n; i++) scanf("%d", bs + i);

  int sum = 0;
  for (int i = 0; i < n; i++) sum += abs(bs[i] - as[i]);

  sti q;
  int k = 0;

  for (int i = 0; i < n; i++) {
    while (! q.empty() && bs[q.top()] < as[i])
      vs[k++] = q.top(), q.pop();

    if (as[i] != bs[i]) q.push(i);
  }

  while (! q.empty()) vs[k++] = q.top(), q.pop();

  printf("%d\n", sum);

  for (int i = 0; i < k; i++) {
    int j = vs[i];
    int l = abs(bs[j] - as[j]);
    char c = (bs[j] > as[j]) ? 'R' : 'L';
    while (l--) printf("%d %c\n", j + 1, c);
  }
  return 0;
}