#RedKnight.py

#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    if ((i_start - i_end) % 2 == 1):
        print("Impossible")
    elif ((i_start - i_end) % 4 == 2) & ((j_start - j_end) % 2 == 0):
        print("Impossible")
    elif ((i_start - i_end) % 4 == 0) & ((j_start - j_end) % 2 == 1):
        print("Impossible")
    else:
        moves = 0
        moveResults = "\n"
        i_cur = i_start
        j_cur = j_start
        while (i_cur < i_end):
            i_cur = i_cur + 2
            if (j_cur > j_end):
                j_cur = j_cur - 1
                moves = moves + 1
                moveResults += "LL "
            else:
                j_cur = j_cur + 1
                moves = moves + 1
                moveResults += "LR "
        while (i_cur > i_end):
            i_cur = i_cur - 2
            if (j_cur > j_end):
                j_cur = j_cur - 1
                moves = moves + 1
                moveResults += "UL "
            else:
                j_cur = j_cur + 1
                moves = moves + 1
                moveResults += "UR "
        while (j_cur < j_end):
            j_cur = j_cur + 2
            moves = moves + 1
            moveResults += "R "
        while (j_cur > j_end):
            j_cur = j_cur - 2
            moves = moves + 1
            moveResults += "L "
        print(moves, moveResults)


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)