#!/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_direct = i_end - i_start x_direct = j_end - j_start if y_direct % 2 == 1 or (y_direct % 4 == 2 and x_direct % 2 == 0) or (y_direct % 4 == 0 and x_direct % 2 == 1): print("Impossible") elif y_direct == 0: if x_direct == 0: print(0) elif x_direct > 0: x_step = x_direct // 2 print(x_step) for i in range(x_step): print('R', end = " ") else: x_step = - x_direct // 2 print(x_step) for i in range(x_step): print('L', end = " ") elif abs(y_direct) <= 2 * abs(x_direct): if y_direct > 0 and x_direct > 0: slope_step = y_direct // 2 print(slope_step + (x_direct - slope_step) // 2) for i in range(slope_step): print('LR', end = " ") for i in range((x_direct - slope_step) // 2): print('R', end = " ") elif y_direct < 0 and x_direct > 0: slope_step = - y_direct // 2 print(slope_step + (x_direct - slope_step) // 2) for i in range(slope_step): print('UR', end = " ") for i in range((x_direct - slope_step) // 2): print('R', end = " ") elif y_direct < 0: slope_step = -y_direct // 2 print(slope_step -(x_direct + slope_step) // 2) for i in range(slope_step): print('UL', end = " ") for i in range(-(x_direct + slope_step) // 2): print('L', end = " ") else: slope_step = y_direct // 2 print(slope_step - (x_direct + slope_step) // 2) for i in range(slope_step): print('LL', end = " ") for i in range(- (x_direct + slope_step) // 2): print('L', end = " ") else: if y_direct > 0: b = (x_direct + y_direct//2 ) // 2 a = b - x_direct print(a+b) if i_start > 0: if b >= a: for i in range(a): print("LL", end = " ") print("LR", end = " ") for i in range(b-a): print("LR", end = " ") else: for i in range(b): print("LL", end = " ") print("LR", end = " ") for i in range(a-b): print("LL", end = " ") else: if b >= a: for i in range(a): print("LR", end = " ") print("LL", end = " ") for i in range(b-a): print("LR", end = " ") else: for i in range(b): print("LR", end = " ") print("LL", end = " ") for i in range(a-b): print("LL", end = " ") else: b = (x_direct - y_direct//2 ) // 2 a = b - x_direct print(a+b) if i_start > 0: if b >= a: for i in range(a): print("UL", end = " ") print("UR", end = " ") for i in range(b-a): print("UR", end = " ") else: for i in range(b): print("UL", end = " ") print("UR", end = " ") for i in range(a-b): print("UL", end = " ") else: if b >= a: for i in range(a): print("UR", end = " ") print("UL", end = " ") for i in range(b-a): print("UR", end = " ") else: for i in range(b): print("UR", end = " ") print("UL", end = " ") for i in range(a-b): print("UL", 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)