var n,i,j,top,bot,u,v,fx,fy,sx,sy:longint;
quex,quey,pr:array [0..100005] of longint;
d:array [0..1000,0..1000] of longint;
ho,hi:array [0..100005] of string;
cha:Array [-16..1005,-16..1005] of string;
procedure pop;
    begin
    inc(bot);
    u:=quex[bot];
    v:=quey[bot];
    end;
procedure push(u,v:longint;s:string);
    var i,j:longint;
    begin
    if  (u=fx)and(v=fy) then
        begin
        i:=0;
        writeln(d[quex[bot],quey[bot]]);
        inc(i);
        ho[i]:=s;
        repeat
        inc(i);
        ho[i]:=hi[bot];
        bot:=pr[bot];
        until cha[quex[bot],quey[bot]]='d';
        for j:=i downto 1 do
            write(ho[j],' ');
            halt;
        end;
    if (cha[u,v]='.') then
        begin
        inc(top);
        quex[top]:=u;
        quey[top]:=v;
        cha[u,v]:=s;
        hi[top]:=s;
        pr[top]:=bot;
        d[u,v]:=d[quex[bot],quey[bot]]+1;
        end      ;
    end;
procedure bfs;
    begin
        repeat
        pop;
        push(u-2,v-1,'UL');
        push(u-2,v+1,'UR');
        push(u,v+2,'R');
        push(u+2,v+1,'LR');
        push(u+2,v-1,'LL');
        push(u,v-2,'L');
        until top=bot;

    end;
begin
    read(N);
    for i:=0 to n-1 do
        for j:=0 to n-1 do
            cha[i,j]:='.';
    readln(sx,sy,fx,fy);
    push(sx,sy,'d');
            bfs;
        write('Impossible');
end.