#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>
#define LP pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
template<class T>
void chmax(T& a, T b) { a = max(a, b); };
template<class T>
void chmin(T& a, T b) { a = min(a, b); };


int main() {
  int n;
  cin >> n;
  vector<int> a(n), b(n), d(n);
  rep(i,n) cin >> a[i];
  rep(i,n) cin >> b[i];
  vector<pair<int, char>> ans;
  rep(i,n) {
    if (a[i] < b[i]) d[i] = 1;
    else if (a[i] > b[i]) d[i] = -1;
  }
  rep(i,n) {
    // left
    if (d[i] == -1) { 
      rep(j,a[i]-b[i]) {
        ans.pb({i+1, 'L'});
      }
    } else if (d[i] == 1) {
      int l = i;
      int r = i;
      while (r+1<n && d[r+1] == 1) {
        r++;
      }
      for (int j = r; j >= l; j--) {
        rep(k,b[j]-a[j]) {
          ans.pb({j+1, 'R'});
        }
      }
      i = r;
    }
  }
  cout << ans.size() << endl;
  for (auto [n, c] : ans) cout << n << " " << c << "\n";  

  
}