#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    stepList = []
    if (i_end - i_start)%2!=0:
        print("Impossible")
        return
    else:
        yDist = i_end - i_start
        xDist = i_end - i_start
        i_now = i_start
        j_now = j_start
        while True:
            if xDist == 0 and yDist == 0:
                break
                
            if yDist > 0:
                i_now += 2
                if xDist < 0:
                    stepList.append("LL")
                    j_now -= 1
                else:
                    stepList.append("LR")
                    j_now += 1
            elif yDist < 0:
                i_now -= 2
                if xDist > 0:
                    stepList.append("UR")
                    j_now += 1
                else:
                    stepList.append("UL")
                    j_now -= 1
            else:
                if xDist != 1 and xDist != -1:
                    if xDist <0:
                        stepList.append("L")
                        j_now -= 2
                    elif xDist >0:
                        stepList.append("R")
                        j_now += 2
                else:
                    print("Impossible")
                    return
            
            yDist = i_end - i_now
            xDist = j_end - j_now
        
        print(len(stepList))
        print(' '.join(str(i) for i in stepList))
        
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)