#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  for(int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for(int i = 0; i < n; i++) {
    cin >> b[i];
  }

  int ans = 0;
  for(int i = 0; i < n; i++) {
    ans += abs(a[i] - b[i]);
  }
  cout << ans << endl;
  vector<int> c(1000005, -1);
  for(int i = 0; i < n; i++) {
    c[a[i]] = i;
  }
  stack<int> st;
  vector<string> s;
  for(int i = 0; i < n; i++) {
    while(abs(a[i] - b[i]) > 0) {
      if(a[i] < b[i]) {
        if(c[a[i] + 1] == -1) {
          cout << i + 1 << " "
               << "R" << endl;
          c[a[i]] = -1;
          a[i]++;
          c[a[i]] = i;
        } else {
          st.push(i);
          break;
        }
      } else if(a[i] > b[i]) {
        if(c[a[i] - 1] == -1) {
          cout << i + 1 << " "
               << "L" << endl;
          c[a[i]] = -1;
          a[i]--;
          c[a[i]] = i;
        } else {
          st.push(i);
          break;
        }
      }
    }
  }
  while(st.size() > 0) {
    int now = st.top();
    st.pop();
    while(abs(a[now] - b[now]) > 0) {
      if(a[now] < b[now]) {
        cout << now + 1 << " "
             << "R" << endl;
        a[now]++;
      } else {
        cout << now + 1 << " "
             << "L" << endl;
        a[now]--;
      }
    }
  }
  return 0;
}