#!/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 abs(i_start-i_end)%2!=0:
        print("Impossible")
    else:
        path=[]
        count=0
        while(i_start!=i_end or j_start!=j_end):
            if(i_start<i_end and j_start<j_end):
                i_start+=2
                j_start+=1
                path.append("LR")
            elif(i_start<i_end and j_start>j_end):
                i_start+=2
                j_start-=1
                path.append("LL")
            elif(i_start<i_end):
                i_start+=2
                j_start+=1
                path.append("LR")
            elif(i_start>i_end and j_start<j_end):
                i_start-=2
                j_start+=1
                path.append("UR")
            elif(i_start>i_end and j_start>j_end):
                i_start-=2
                j_start-=1
                path.append("UL")
            elif(i_start>i_end):
                i_start-=2
                j_start-=1
                path.append("UL")
            elif(i_start==i_end and j_start<j_end):
                j_start+=2
                path.append("R")
            elif(i_start==i_end and j_start>j_end):
                j_start-=2
                path.append("L")
            count+=1
        print(count)
        for i in path:
            print(i,end=" ")
        
        
            
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)