import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }
double[] rotate(double[] vec, double rad) { return [cos(rad)*vec[0] - sin(rad)*vec[1], sin(rad)*vec[0] + cos(rad)*vec[1]]; }

//long mod = 10^^9 + 7;
long mod = 998_244_353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }
void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto M = RD;
	auto A = RDA;
	auto B = RDA;

	auto d = new long[](M);
	foreach (i; 0..M)
	{
		d[i] = B[i] - A[i];
	}

	long[] k;
	char[] c;
	long ll, rr = M-1;
	foreach (i; 0..M)
	{
		if (d[i] > 0) break;
		foreach (_; 0..d[i].abs)
		{
			k ~= i+1;
			c ~= 'L';
		}
		++ll;
	}
	foreach_reverse (i; 0..M)
	{
		if (d[i] < 0) break;
		foreach (_; 0..d[i].abs)
		{
			k ~= i+1;
			c ~= 'R';
		}
		--rr;
	}
	debug writeln(k);
	debug writeln(c);

	long i = ll;
	while (i < rr)
	{
		if (i < ll)
		{
			i = ll;
			continue;
		}
		if (d[i].sgn != d[i+1].sgn)
		{
			foreach_reverse (j; ll..i+1)
			{
				foreach (_; 0..d[j].abs)
				{
					k ~= j+1;
					c ~= 'R';
				}
			}
			ll = rr+1;
			foreach (j; i+1..rr+1)
			{
				if (d[j] > 0)
				{
					ll = j;
					break;
				}
				foreach (_; 0..d[j].abs)
				{
					k ~= j+1;
					c ~= 'L';
				}
			}
			debug writeln("i:", i, " ", k, c);
		}
		++i;
	}

	writeln(k.length);
	foreach (j; 0..k.length)
	{
		writeln(k[j], " ", c[j]);
	}
	stdout.flush;
	debug readln;
}