#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N, M=0;
    cin >> N;
    vector<int> A(N), B(N);
    for (int i=0; i<N; i++) cin >> A[i];
    for (int i=0; i<N; i++){
        cin >> B[i];
        M += abs(A[i]-B[i]);
    }
    cout << M << endl;
    for (int i=N-1; i>=0; i--){
        if (A[i] < B[i]) for (int j=0; j<B[i]-A[i]; j++) cout << i+1 << " " << 'R' << endl;
    }
    for (int i=0; i<N; i++){
        if (A[i] > B[i]) for (int j=0; j<A[i]-B[i]; j++) cout << i+1 << " " << 'L' << endl;
    }

    return 0;
}