#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    if (i_start%2==0 and i_end%2!=0) or (i_start%2!=0 and i_end%2==0):
        print("Impossible")
    else:
        val=abs(i_start-j_end)-1
        print(val)
        for i in range(val):
            if abs(i_start-i_end)%4==0 and (j_start==j_end):
                print ("LR LL",end=" ")
            elif j_start-j_end >=4:
                print("L",end=" ")
                j_start-=2
            elif (j_start-j_end)<=-4:
                print("R",end=" ")
                j_start+=2
            

if __name__ == "__main__":
    n = int(input().strip())
    i_start, j_start, i_end, j_end = input().strip().split(' ')
    i_start, j_start, i_end, j_end = [int(i_start), int(j_start), int(i_end), int(j_end)]
    printShortestPath(n, i_start, j_start, i_end, j_end)