#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el endl
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define inp(x) for(auto &i:x)cin>>i
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n,cnt=0;cin>>n;
  vl A(n),B(n);inp(A);inp(B);
  vector<pair<ll,char>> ans;
  priority_queue<ll,vector<ll>,greater<ll>> mex;
  REP(i,1,B[n-1]+1){
    if(cnt==n||i!=A[cnt]){
      mex.push(i);
    }else{
      cnt++;
    }
  }
  rep(i,0,n){
  while(A[i] != B[i]){
    if(A[i] > B[i]){
      ans.push_back({i+1, 'L'});
      A[i]--;
    }else{
      while(!mex.empty() && mex.top() < A[i]){
        mex.pop();
      }

      ll m = mex.top();
      auto it = upper_bound(all(A), m);
      it--;

      ans.push_back({it - A.begin() + 1, 'R'});
      A[it - A.begin()]++;

      mex.pop();
      mex.push(m - 1);
    }
  }
}
  cout<<ans.size()<<el;
  for(auto [i,c]:ans){
    cout<<i<<spa<<c<<el;
  }
}