#include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef pair<int,int> P ;
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)

int n ;
int A[202020] , B[202020] ;
bool dir[202020] ;
set<int> st ;

int main(){
    cin >> n ;
    A[0] = -10101010 ;
    rep(i,n) cin >> A[i+1] ;
    rep(i,n) cin >> B[i+1] ;
    A[n + 1] = 10101010 ;
    int sum = 0 ;
    rrep(i,1,n+1) st.insert(i) ;
    cout << sum << endl ;
    while(st.size() != 0){
        for(int u : st){
            if(A[u] < B[u]){
                while(A[u] + 1 != A[u + 1] && A[u] != B[u]){
                    A[u]++ ;
                    cout << u << " " << 'R' << "\n" ;
                    sum-- ;
                }
            }
            if(A[u] > B[u]){
                while(A[u] - 1 != A[u - 1] && A[u] != B[u]){
                    A[u]-- ;
                    cout << u << " " << 'L' << "\n" ;
                    sum-- ;
                }
            }
            if(A[u] == B[u]) st.erase(u) ;
        }
    }
}