#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=INF;
const ll MAX=200010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;



signed main(){
    ll n;cin>>n;
    vector<ll>a(n),b(n);
    rep(i,n){
        cin>>a[i];
    }
    rep(i,n)cin>>b[i];
    vector<ll>ans(0);
    ll now=0;
    stack<ll>st;
    ll sum=0;

    rep(i,n){
        sum+=abs(a[i]-b[i]);
        st.push(i);
        if(a[i]>b[i]){
            while(!st.empty()){
                ll k=st.top();
                ans.pb(k);
                st.pop();
            }
        }
    }
    while(!st.empty()){
        ll k=st.top();
        ans.pb(k);
        st.pop();
    }
    cout<<sum<<endl;
    rep(i,ans.size()){
        ll id=ans[i];
        if(a[id]>b[id]){
            rep(j,abs(a[id]-b[id])){
                cout<<id+1<<' '<<'L'<<endl;
            }
        }else{
            rep(j,abs(a[id]-b[id])){
                cout<<id+1<<' '<<'R'<<endl;
            }
        }
    }
}