#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;
using P = pair<int, int>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; 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];

    priority_queue<P> que;
    int m = 0;
    for(int i = 0; i < n; i++) m += abs(a[i]-b[i]);
    auto push = [&](int i){
        if(a[i] < b[i]){
            que.push(P(abs(a[i]-b[i]), i));
        }
        if(a[i] > b[i]){
            que.push(P(abs(a[i]-b[i]), -i));
        }
    };
    for(int i = 0; i < n; i++) push(i);
    cout << m << endl;
    while(!que.empty()){
        auto [d, _i] = que.top(); que.pop();
        int i = abs(_i);
        if(d == 0) continue;
        if(a[i] < b[i]) {
            a[i]++;
            cout << i+1 << ' ' << 'R' << endl;
        }else{
            a[i]--;
            cout << i+1 << ' ' << 'L' << endl;
        }
        // for(int i = 0; i < n; i++) cout << a[i] << ' ';
        // cout << endl;
        push(i);
    }
}