// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

use std::collections::*;
use std::io::Write;

type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn run() {
    input! {
        n: usize,
        a: [i32; n],
        b: [i32; n],
    }
    let mut set = Set::new();
    for a in a.iter() {
        set.insert(*a);
    }
    let mut valid = Deque::new();
    let mut elem = vec![false; n];
    for i in 0..n {
        let l = a[i].min(b[i]);
        let r = a[i].max(b[i]);
        let mut it = set.range(l..=r);
        if *it.clone().next().unwrap() == a[i] && *it.next_back().unwrap() == a[i] {
            valid.push_back(i);
            elem[i] = true;
        }
    }
    let mut ans = vec![];
    while let Some(v) = valid.pop_front() {
        set.remove(&a[v]);
        if a[v] > b[v] {
            ans.push((v + 1, 'L', a[v] - b[v]));
        } else if a[v] < b[v] {
            ans.push((v + 1, 'R', b[v] - a[v]));
        }
        for &u in [v - 1, v + 1].iter() {
            if u >= n || elem[u] {
                continue;
            }
            let l = a[u].min(b[u]);
            let r = a[u].max(b[u]);
            let mut it = set.range(l..=r);
            if *it.clone().next().unwrap() == a[u] && *it.next_back().unwrap() == a[u] {
                valid.push_back(u);
                elem[u] = true;
            }
        }
    }
    let s = ans.iter().map(|p| p.2).sum::<i32>();
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    writeln!(out, "{}", s).ok();
    for (v, c, k) in ans {
        for _ in 0..k {
            writeln!(out, "{} {}", v, c).ok();
        }
    }
}

fn main() {
    run();
}