#!/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_end-i_start)%2!=0):
        print("Impossible")
    else:
        li=[]
        m=0
        while(i_end<i_start and j_end<=j_start):
            m+=1
            li.append("UL")
            i_start-=2
            j_start-=1
        while(i_end<i_start and j_end>=j_start):
            m+=1
            li.append("UR")
            i_start-=2
            j_start+=1
        while(j_start<j_end):
            m+=1
            li.append("R")
            j_start+=2
        while(i_end>i_start and j_end>=j_start):
            m+=1
            li.append("LR")
            i_start+=2
            j_start+=1
        while(i_end>i_start and j_end<=j_start):
            m+=1
            li.append("LL")
            i_start+=2
            j_start-=1
        while(j_start>j_end):
            m+=1
            li.append("L")
            j_start-=2
        print(m)
        for i in li:
            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)