#!/bin/python3 import sys def printShortestPath(n, i_start, j_start, i_end, j_end): # Print the distance along with the sequence of moves. y = i_end - i_start x = j_end - j_start if abs(y)%2 != 0 or abs(abs(x) - abs(y)//2)%2 != 0: print("Impossible") return res = [] while True: if y > 0: if x > 0: for t in range(0,y,2): x -= 1 res.append('4') y %= 2 elif x < 0: for t in range(0,y,2): x += 1 res.append('5') y %= 2 else: for t in range(0,y,4): res.append('4') res.append('5') y %= 4 elif y < 0: if x > 0: for t in range(0,abs(y),2): x -= 1 res.append('2') y = abs(y)%2 elif x < 0: for t in range(0,abs(y),2): x += 1 res.append('1') y = -abs(y)%2 else: for t in range(0,abs(y),4): res.append('1') res.append('2') y = -abs(y)%4 elif y == 0: if x > 0: for t in range(0,x,2): res.append('3') x = abs(x)%2 elif x < 0: for t in range(0,abs(x),2): res.append('6') x = -abs(x)%2 else: break print(len(res)) res.sort() string = '' s = '' for x in res: if(x == '1'): string += 'UL' + " " elif x == '2': string += 'UR' + " " elif x == '3': string += 'R' + " " elif x == '4': string += 'LR' + " " elif x == '5': string += 'LL' + " " elif x == '6': string += 'L' + " " print(string) 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)