#!/bin/python

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    if abs(i_start-i_end)&1:
        print "Impossible"
    else:
        i = i_start-i_end
        j = j_start-j_end
        steps = []
        count = 0
        while abs(i)>0 and abs(j)>2:
            count += 1
            if i<0 and j<0:
                steps.append("LR")
                i+=2
                j+=1
            elif i<0 and j>0:
                steps.append("LL")
                i+=2
                j-=1
            elif i>0 and j<0:
                steps.append("UR")
                i-=2
                j+=1
            elif i>0 and j>0:
                steps.append("UL")
                i-=2
                j-=1
        while abs(j)>0:
            count+=1
            if j<0:
                steps.append("R")
                j+=2
            else:
                steps.append("L")
                j-=2
        while abs(i)>0:
            count+=2
            if i<0:
                steps.append("LR LL")
                i+=4
            else:
                steps.append("UR UL")
                i-=4
        print count
        print ' '.join(steps)
         
            
    

if __name__ == "__main__":
    n = int(raw_input().strip())
    i_start, j_start, i_end, j_end = raw_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)