#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

int used[1000000 + 1];

int main() {
    fill(begin(used), end(used), -1);

    int n; cin >> n;
    auto a = vec<int>(uns, n);
    auto b = vec<int>(uns, n);
    for (auto &e : a) cin >> e;
    for (auto &e : b) cin >> e;

    for (int i = 0; i < n; ++i) {
        used[a[i]] = i;
    }

    auto d = vec<int>(uns, n);
    for (int i = 0; i < n; ++i) {
        d[i] = b[i] - a[i];
    }

    int sum = 0;
    for (auto v : d) {
        sum += abs(v);
    }

    auto sign = [](int x) {
        return clamp(x, -1, +1);
    };

    auto solve = [&](auto &&self, int v) -> void {
        used[a[v]] = -1;

        int c = abs(d[v]);
        for (int i = 1; i <= abs(d[v]); ++i) {
            int next = a[v] + sign(d[v]) * i;
            if (0 <= used[next]) {
                self(self, used[next]);
            }
            cout << v + 1 << ' ' << (d[v] < 0 ? 'L' : 'R') << endl;
        }

        d[v] = 0;
    };

    cout << sum << endl;

    for (int i = 0; i < n; ++i) {
        solve(solve, i);
    }
}