#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,char>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n), b(n);
	rep(i, n)cin >> a[i];
	rep(i, n)cin >> b[i];
	vector<P>ans;
	int l = 0;
	while (l < n) {
		int r = l;
		if (a[l] >= b[l]) {
			rep(i, a[l] - b[l])ans.push_back({ l, 'L' });
			l++;
		}
		else {
			while ((r < n) && (a[r] < b[r])) {
				r++;
			}
			rrep2(i, l, r) {
				rep(j, b[i] - a[i])ans.push_back({ i,'R' });
			}
			l = r;
		}
	}
	cout << ans.size() << endl;
	rep(i, ans.size()) cout << ans[i].first + 1 << " " << ans[i].second << endl;
	return 0;
}