#!/bin/python

import sys

ways = [[-2,-1], [-2,1], [0,2], [2,1], [2,-1], [0,-2]]

def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    i = i_start
    j = j_start
    
    if i%2 != 0:
        print 'Impossible'
    else:
        c = 0
        path=[]
        #print i_end-i, j_end-j
        while 1:
            if (i_end-i) > 0 and (j_end-j) > 0:
                i+=2; j+=1; path.append('LR')
            elif (i_end-i) < 0 and (j_end-j) < 0:
                i-=2; j-=1; path.append('UL')
            elif (i_end-i) > 0 and (j_end-j) < 0:
                i+=2; j-=1; path.append('LL')
            elif (i_end-i) < 0 and (j_end-j) > 0:
                i-=2; j+=1; path.append('UR')
            elif (i_end-i) > 0 and (j_end-j) == 0:
                i+=2 
                if (j+1) < n: j+=1; path.append('LR')
                if (j+1) >= n: j-=1; path.append('LL')
            elif (i_end-i) < 0 and (j_end-j) == 0:
                i-=2
                if (j+1) < n: j+=1; path.append('UR')
                if (j+1) >= n: j-=1; path.append('UL')
            elif (i_end-i) == 0 and (j_end-j) > 0:
                j+=2; path.append('R')
            elif (i_end-i) == 0 and (j_end-j) < 0:
                j-=2; path.append('L')
            elif (i_end-i) == 0 and (j_end-j) == 0:
                print c
                print " ".join(path)
                break
            c+=1
        #print c

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)