#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <tuple>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

int n;
int a[200000];
int b[200000];

signed main() {
	int i, j;
	
	cin >> n;
	rep(i, n) cin >> a[i];
	rep(i, n) cin >> b[i];
	
	typedef pair<int, char> P;
	vector<P> ans;
	
	//まず'L'から処理する
	rep(i, n) {
		if (a[i] <= b[i]) continue;
		rep(j, a[i] - b[i]) {
			ans.push_back(P(i, 'L'));
		}
	}
	
	//次に'R'を処理する
	for (i = n - 1; i >= 0; i--) {
		if (a[i] >= b[i]) continue;
		rep(j, b[i] - a[i]) {
			ans.push_back(P(i, 'R'));
		}
	}
	
	cout << ans.size() << endl;
	rep(i, ans.size()) {
		cout << ans[i].first + 1 << " " << ans[i].second << endl;
	}
	return 0;
}