#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int N;
  cin >> N;
  vector<int> A(N);
  REP(i, N) cin >> A[i];
  REP(i, N) A[i]--;
  vector<int> B(N);
  REP(i, N) cin >> B[i];
  REP(i, N) B[i]--;
  vector<int> board(1000000, -1);
  REP(i, N) board[A[i]] = i;
  vector<vector<int>> nbr(N);
  unordered_set<int> root;
  REP(i, N) root.insert(i);
  REP(i, N) {
    if(A[i] < B[i]) {
      FOR(j, A[i]+1, B[i]+1) if(board[j] != -1) {
        nbr[board[j]].push_back(i); 
        root.erase(i);
        break;
      }
    } else if(A[i] > B[i]) {
      IFOR(j, B[i], A[i]) if(board[j] != -1) {
        nbr[board[j]].push_back(i); 
        root.erase(i);
        break;
      }
    }
  }
  vector<pair<int, char>> ans;
  deque<int> que;
  for(int x : root) que.push_back(x);
  while(!que.empty()) {
    int x = que.front();
    que.pop_front();
    if(A[x] < B[x]) REP(k, B[x] - A[x]) ans.push_back(make_pair(x+1, 'R'));
    else if(A[x] > B[x]) REP(k, A[x] - B[x]) ans.push_back(make_pair(x+1, 'L'));
    for(int y : nbr[x]) que.push_back(y);
  }
  cout << ans.size() << "\n";
  REP(i, ans.size()) cout << ans[i].first << " " << ans[i].second << "\n";
}