#include <bits/stdc++.h>

using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

class rep {
    struct Iter {
        usize itr;
        constexpr Iter(const usize pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr usize operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

template <class T> using Vec = std::vector<T>;

void main_() {
    usize N;
    std::cin >> N;
    Vec<usize> A(N), B(N);
    for (auto& x : A) {
        std::cin >> x;
    }
    for (auto& x : B) {
        std::cin >> x;
    }
    Vec<usize> left, right;
    usize cnt = 0;
    for (const auto i : rep(0, N)) {
        if (A[i] < B[i]) {
            right.push_back(i);
            cnt += B[i] - A[i];
        }
        if (A[i] > B[i]) {
            left.push_back(i);
            cnt += A[i] - B[i];
        }
    }
    std::cout << cnt << '\n';
    for (const auto i : left) {
        for (const auto k : rep(0, A[i] - B[i])) {
            std::cout << i + 1 << ' ' << 'L' << '\n';
        }
    }
    std::reverse(right.begin(), right.end());
    for (const auto i : right) {
        for (const auto k : rep(0, B[i] - A[i])) {
            std::cout << i + 1 << ' ' << 'R' << '\n';
        }
    }
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    main_();
    return 0;
}