#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    b=[]
    counter=0
    if int(i_end)%2 != int(i_start)%2:
        b.append("Impossible")
        return b
    a=[i_end-i_start,j_end-j_start]
    if a[0]==0 and a[1]<0:
        if int(abs(a[1]/2))==0:
            b.append("Impossible")
            return b
        b.append(" ".join(int(abs(a[1]/2))*"L "))
        counter+=int(a[1]/2)
        quit()
    elif a[0]==0 and a[1]>0:
        b.append(" ".join(int(a[1]/2))*"R ")
        counter+=int(a[1]/2)
        quit()
    elif a[0]>0 and a[1]==0:
        for i in range(int(a[0]/4)):
            b.append("LR")
            b.append("LL")
        counter+=int(abs(a[0]/4)*2)
        return [str(counter)+'\n'+" ".join(b)]
    elif a[0]<0 and a[1]==0:
        b.append(" ".join(int(abs(a[0]/4))*("UL "+"UR ")))
        counter+=int(abs(a[0]/4)*2)
        return [str(counter)+'\n'+" ".join(b)]
    if a[0]>0:
        if a[1]>0:
            while a[0]>0:
                a[0]-=2
                a[1]-=1
                b.append("LR")
                counter+=1
            while a[1]>0:
                a[1]-=2
                b.append("R")
                counter+=1
        if a[1]<0:
            while a[0]>0:
                a[0]-=2
                a[1]+=1
                b.append("LL")
                counter+=1
            while a[1]<0:
                a[1]+=2
                b.append("L")
                counter+=1
    else:
        if a[1]>0:
            while a[0]<0:
                a[0]+=2
                a[1]-=1
                b.append("UR")
                counter+=1
            while a[1]>0:
                a[1]-=2
                b.append("R")
                counter+=1
        if a[1]<0:
            while a[0]<0:
                a[0]+=2
                a[1]+=1
                b.append("UL")
                counter+=1
            while a[1]<0:
                a[1]+=2
                b.append("L")
                counter+=1
    return [str(counter)+'\n'+" ".join(b)]
            
            
        
        
                       
        

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)]
    print("".join(printShortestPath(n, i_start, j_start, i_end, j_end)))