import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); }
void log()(){ writeln(""); } void log(T, A ...)(T t, lazy A a){ if(DEBUG) write(t, " "), log(a); } bool DEBUG = 0; 
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
T read(T)(){ return read.to!T; }
T[] read(T)(long n){ return n.iota.map!(_ => read!T).array; }
T[][] read(T)(long m, long n){ return m.iota.map!(_ => read!T(n)).array; }
// ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- //

void solve(){
	
	int n = read.to!int;
	long[] as;
	foreach(i; 0 .. n) as ~= read.to!long;
	
	string ans;
	int i = 0, j = n - 1;
	long x = -1;
	while(i <= j){
		if(as[i] < as[j]){
			if(x < as[i]) x = as[i], ans ~= "L", i += 1;
			else if(x < as[j]) x = as[j], ans ~= "R", j -= 1;
			else break;
		}
		else{
			if(x < as[j]) x = as[j], ans ~= "R", j -= 1;
			else if(x < as[i]) x = as[i], ans ~= "L", i += 1;
			else break;
		}
	}
	
	ans.length.writeln;
	ans.writeln;
}
