#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    s=False
    str=""
    if i_start%2==i_end%2 and ( ((i_start/2)%2==(i_end/2)%2) == (j_start%2==j_end%2) ):
        while(i_start > i_end and (j_start >= j_end)):
            if s:
                str+=" "
            str+="UL"
            s=True
            i_start-=2
            j_start-=1
        while(i_start > i_end and j_start < j_end):
            if s:
                str+=" "
            str+="UR"
            s=True
            i_start-=2
            j_start+=1
        while(j_start < j_end):
            if s:
                str+=" "
            str+="R"
            s=True
            j_start+=2
        while(i_start < i_end and j_start <=j_end):
            if s:
                str+=" "
            str+="LR"
            s=True
            i_start+=2
            j_start+=1
        while(i_start < i_end and j_start > j_end):
            if s:
                str+=" "
            str+="LL"
            s=True
            i_start+=2
            j_start-=1
        while(j_start > j_end):
            if s:
                str+=" "
            str+="L"
            s=True
            j_start-=2
        print(str.count(" ")+1)
        print(str,end='')
    else:
        print("Impossible")

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)