#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const long long MOD = 1000000007;
const long long INF = 9*1e18;
using ll = long long;
using mint = modint1000000007;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
long double PI = 3.14159265358979;
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  ll N;
  cin>>N;
  vector<ll> A(N),B(N);
  vector<ll> sa(N);
  rep(i,N){
    cin>>A[i];
  }
  rep(i,N){
    cin>>B[i];
  }
  ll ans = 0;
  rep(i,N){
    ans += abs(A[i]-B[i]);
    sa[i] = B[i]-A[i];
  }
  cout << ans << endl;
  ll owatta = -1;
  rep(i,N){
    if(sa[i] > 0){
      continue;
    }
    else{
      for(int k = A[i];k>B[i];k--){
        cout << i+1 << " L" << endl;
      }
      for(int k = i-1;k>owatta;k--){
        for(int p = A[k];p<B[k];p++){
          cout << k+1 << " R" << endl;
        }
      }
      owatta = i;
    }
  }
  for(int i = N-1;i>owatta;i--){
    for(int k = A[i];k<B[i];k++){
      cout << i+1 << " R" << endl;
    }
  }
  return 0;
}