#!/bin/python3

import sys
path  = []
def abc(n, i_start, j_start, i_end, j_end) :
    a = i_start
    b = j_start
    c = i_end
    d = j_end
    if abs(i_start-i_end)%2 != 0 :
        return 
    else :
        if(i_start-i_end) < 0 :
            i_start += 2
            if(j_start-j_end) < 0 :
                j_start -= 1
                path[0] += 1
                path.append('LL')
                abc(n, i_start, j_start, i_end, j_end)
            elif(j_start-j_end) > 0 :
                j_start += 1 
                path[0] += 1
                path.append('LR')
                abc(n, i_start, j_start, i_end, j_end)
            else  :
                if abs(a-c) % 4 != 0 :
                    return
                else :
                    t = abs(a-c)//4
                    for _ in range(t) :
                        path[0] += 2
                        path.append('LR')
                        path.append('LL')
                    return   
                
        elif (i_start-i_end) > 0 :
            i_start -= 2
            if(j_start-j_end) < 0 :
                j_start += 1
                path[0] += 1
                path.append('UR')
                abc(n, i_start, j_start, i_end, j_end)
            elif(j_start-j_end) > 0 :
                j_start -= 1 
                path[0] += 1
                path.append('UL')
                abc(n, i_start, j_start, i_end, j_end)
            else  :
                if abs(a-c)%4 != 0 :
                    return
                else :
                    t = abs(a-c)//4
                    for _ in range(t) :
                        path[0] += 2
                        path.append('UL')
                        path.append('UR')
                    return  
                
        else   : 
            if abs(b-d)%2 != 0 :
                    return
            else :
                t = abs(b-d)//2
                if (b-d) >0 :
                    for _ in range(t) :
                        path[0] += 1
                        path.append('L')
                    return 
                elif (b-d) <0 :
                    for _ in range(t) :
                        path[0] += 1
                        path.append('R')
                    return 
        
def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    path.append(0)
    abc(n, i_start, j_start, i_end, j_end)
    if path[0] == 0 :
        print("Impossible")
    else :
        print(path[0])
        del(path[0])
        print(' '.join(path))
    
            
    

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)