use std::collections::VecDeque; fn main() { let mut n = String::new(); std::io::stdin().read_line(&mut n).ok(); let n: usize = n.trim().parse().unwrap(); let mut a = String::new(); std::io::stdin().read_line(&mut a).ok(); let mut a: Vec = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let mut b = String::new(); std::io::stdin().read_line(&mut b).ok(); let b: Vec = b.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let mut checked = vec![false; n]; let mut queue = VecDeque::new(); for i in 0..n { if i == 0 { if a[0] >= b[0] || 1 == n || b[0] < a[1] { queue.push_back((a[0], b[0], 0)); checked[i] = true; } } else if i == n-1 { if a[i] <= b[i] || a[i-1] < b[i] { queue.push_back((a[i], b[i], i)); checked[i] = true; } } else { if a[i-1] < b[i] && b[i] < a[i+1] { queue.push_back((a[i], b[i], i)); checked[i] = true; } } } let mut operates = Vec::with_capacity(n); while let Some((start, end, idx)) = queue.pop_front() { operates.push((start, end, idx)); a[idx] = end; if idx > 0 && !checked[idx-1] { if b[idx-1] < a[idx] && (idx == 1 || a[idx-2] < b[idx-1]) { queue.push_back((a[idx-1], b[idx-1], idx-1)); checked[idx-1] = true; } } if idx+1 < n && !checked[idx+1] { if a[idx] < b[idx+1] && (idx+2 == n || b[idx+1] < a[idx+2]) { queue.push_back((a[idx+1], b[idx+1], idx+1)); checked[idx+1] = true; } } } let mut result = vec![]; for &(start, end, idx) in operates.iter() { for _ in 0..start.max(end)-start.min(end) { if start < end { result.push((idx+1, 'R')); } else { result.push((idx+1, 'L')) } } } println!("{}", result.len()); for &(i, c) in result.iter() { println!("{} {}", i, c); } }