import sys


def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    List = []
    i=i_start
    j=j_start    
    if (i_start-i_end)%2 != 0:
        print('Impossible')
        return
    while(True):
        if i==i_end and j==j_end:
            break
        if i == i_end:
            if abs(j-j_end)%2 == 0:
                for _ in range(int(abs((j-j_end)/2))):
                    List.append('R' if j<j_end else 'L' )
            else:
                print('Impossible')
                return
            break
        elif j == j_end:
            if abs(i_start-i_end)%4 == 0:
                for _ in range(int(abs((i-i_end)/4))):
                    List.append('LR' if i<i_end else 'UR')
                    List.append('LL' if i<i_end else 'UL')
            else:
                print('Impossible')
                return
            break  
        else:
            if(i_start < i_end and j_start < j_end):
                if(i>i_end or j>j_end):
                    print('Impossible')
                    return
                else:
                    List.append('LR')
                    i+=2
                    j+=1
            elif i_start < i_end and j_start > j_end:
                if(i>i_end or j<j_end):
                    print('Impossible')
                    return
                else:
                    List.append('LL')
                    i+=2
                    j-=1  
            elif i_start > i_end and j_start < j_end:
                if(i<i_end or j>j_end):
                    print('Impossible')
                    return
                else:
                    List.append('UR')
                    i-=2
                    j+=1 
            elif i_start > i_end and j_start > j_end:
                if(i<i_end or j<j_end):
                    print('Impossible')
                    return
                else:
                    List.append('UL')
                    i-=2
                    j-=1                     
    print(len(List))
    print(' '.join(List))      
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)