#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;
 
#include<bits/stdc++.h>
using namespace std;
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  int n;
  cin>>n;
  vector<int> A(n),B(n);
  rep(i,n) cin>>A[i];
  rep(i,n) cin>>B[i];
  
  int m=0;
  deque<int> q;
  rep(i,n){
    if(A[i]>B[i]) q.push_back(i);
    else if(A[i]<B[i]) q.push_front(i);
    m+=abs(A[i]-B[i]);
  }
  
  cout<<m<<endl;
  while(!q.empty()){
    int t=q[0];
    if(A[t]>B[t]) rep(i,A[t]-B[t]) cout<<t+1<<" "<<'L'<<endl;
    else rep(i,B[t]-A[t]) cout<<t+1<<" "<<'R'<<endl;
    q.pop_front();
  }

  return 0;
}