#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>

#define mkp make_pair
#define mkt make_tuple
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
template <class T>
void chmin(T &a, const T &b) {
    if (a > b) a = b;
}
template <class T>
void chmax(T &a, const T &b) {
    if (a < b) a = b;
}

void solve() {
    int N;
    cin >> N;
    vector<int> A(N), B(N);
    rep(i, N) cin >> A[i];
    rep(i, N) cin >> B[i];

    vector<pair<int, char>> output;
    int now = 0;
    while (now < N) {
        if (A[now] >= B[now]) {
            rep(_, A[now] - B[now]) {
                output.emplace_back(now, 'L');
            }
            now++;
            continue;
        }

        int nex = now;
        while (nex < N) {
            if (A[nex] >= B[nex]) break;
            nex++;
        }

        for (int i = nex - 1; i >= now; i--) {
            rep(_, B[i] - A[i]) {
                output.emplace_back(i, 'R');
            }
        }
        now = nex;
    }

    cout << output.size() << "\n";
    for (auto [n, c] : output) cout << n + 1 << " " << c << "\n";
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}