#!/bin/python

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    count = 0
    a = i_start
    b = j_start
    i_diff = abs(i_start - i_end)
    
    j_diff = abs(j_start - j_end)
    t_diff = i_diff + j_diff
    if i_start >=n or j_start >=n or i_end >=n or j_end >=n:
        print "Impossible"
    #print i_diff, j_diff
    moves =""
    diff=-1
    mindist = 1000
    for i in range(n):
        flag = 0
        if n-1>=a-2 >=0 and n-1>=b-1 >= 0 and (abs((a -2) - i_end) +  abs((b-1)- j_end)) <  abs(t_diff ): #UL
            dist = (abs((a -2) - i_end) +  abs((b-1)- j_end))
            
            if dist < mindist:
                mindist =dist
                diff = 0
                flag = 1
        if n-1>=a-2 >=0 and n-1>=b+1 >= 0 and (abs(a-2- i_end) + abs(b+1 - j_end)) < t_diff: #UR
            dist=(abs((a -2) - i_end) +  abs((b+1)- j_end))
            
            if dist < mindist:
                mindist =dist
                diff = 1
                flag =1
        if n-1>=b+2 >=0 and  abs(a-i_end)+abs(b + 2 - j_end) < t_diff:#R
            dist = abs(a-i_end) + abs(b + 2 - j_end)
            
            if dist < mindist:
                mindist =dist
                diff = 2
                flag =1
        
        if n-1>=a+2 >=0 and n-1>=b+1 >= 0 and (abs(a + 2 - i_end) + abs(b + 1 - j_end) < t_diff):#LR
            dist = (abs(a + 2 - i_end) + abs(b + 1 - j_end))
            if dist < mindist:
                mindist =dist
                diff = 3
                flag =1
        
        if n-1>=a+2 >=0 and n-1>=b-1 >= 0 and (abs(a + 2 - i_end) + abs(b - 1 - j_end) < t_diff):#LL
            
            dist = (abs(a + 2 - i_end) + abs(b - 1 - j_end))
            if dist < mindist:
                mindist =dist
                diff = 4
                flag =1
                    
        if n-1>=b-2 >= 0 and abs(a-i_end)+abs(b - 2 - j_end) < t_diff:#L
            dist = abs(a-i_end) + abs(b - 2 - j_end)
            if dist < mindist:
                mindist =dist
                diff = 5
                flag =1
        #else:
            #flag = 0
        
        
        if flag==0:
            print "Impossible"
            break
                    
        else:

            if diff ==0:
            
            
                count +=1
                a = a - 2
                b = b - 1
            
                
                #print "UL",
                moves = moves + "UL "
            
                i_diff = abs(a - i_end)
                j_diff = abs(b - j_end)
                t_diff = i_diff + j_diff
                
                #print "UL "
                #print t_diff
                
                
            
                if a==i_end and b == j_end:
                    
                    print count
                    print moves
                    break
            
                #print a,b
            
            
        
            elif diff==1: #UR
            
            
                a = a - 2
                b = b + 1
                count +=1
                moves = moves + "UR "
                
                i_diff = abs(a - i_end)
                j_diff = abs(b - j_end)
                t_diff = i_diff + j_diff    
                #print "UR "
                if a==i_end and b == j_end:
                    
                    print count
                    print moves
                    break
            
            
            
            elif diff==2:#R
            
         
                b = b + 2
            
                #b = b - 2 
                count +=1
                moves = moves + "R "
           
                i_diff = abs(a - i_end)
                j_diff = abs(b - j_end)
                t_diff = i_diff + j_diff
                #print "R "
                if a==i_end and b == j_end:
                    
                    print count
                    print moves
                    break
            elif diff==3:#LR
            
            
                a = a + 2
                b = b + 1
                count +=1
                moves = moves + "LR "
            
                i_diff = abs(a - i_end)
                j_diff = abs(b - j_end)
                t_diff = i_diff + j_diff
                #print "LR "
                #print t_diff
                if a==i_end and b == j_end:
                    
                    print count
                    print moves
                    break
            
            
            
            elif diff==4:#LL
           
                a = a + 2
                b = b - 1
                count +=1
                moves = moves + "LL "            
                i_diff = abs(a - i_end)
                j_diff = abs(b - j_end)
                t_diff = i_diff + j_diff
                #print "LL "
                if a==i_end and b == j_end:
                    
                    print count
                    print moves
                    break
            
           
            
            elif diff==5:#L
            
                b = b - 2
                count +=1
                moves = moves + "L "
                
                i_diff = abs(a - i_end)
                j_diff = abs(b - j_end)
                t_diff = i_diff + j_diff
                #print "L "
       
                
                if a==i_end and b == j_end:
                    
                    print count
                    print moves
                    break
            
           
        if count >=n:
            print "Impossible"
        
            #print count
            
            
            
    
    #  Print the distance along with the sequence of moves.

if __name__ == "__main__":
    n = int(raw_input().strip())
    i_start, j_start, i_end, j_end = raw_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)