import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) { String seq =""; int i = 0; while(i0 && (j_start - j_end)>=0) { i_start -= 2; j_start -= 1; seq += "UL "; } else if((i_start - i_end) > 0 && (j_start - j_end) <= 0) { i_start -= 2; j_start += 1; seq += "UR "; } else if((i_start - i_end) == 0 && (j_start - j_end) <= 0) { j_start += 2; seq += "R "; } else if((i_start - i_end) < 0 && (j_start - j_end) <= 0) { i_start += 2; j_start += 1; seq += "LR "; } else if((i_start - i_end) < 0 && (j_start - j_end) >= 0) { i_start += 2; j_start -= 1; seq += "LL "; } else if((i_start - i_end) == 0 && (j_start - j_end) >= 0) { j_start -= 2; seq += "L "; } else { System.out.println("Impossible"); return; } i++; } System.out.println("Impossible"); } public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int i_start = in.nextInt(); int j_start = in.nextInt(); int i_end = in.nextInt(); int j_end = in.nextInt(); printShortestPath(n, i_start, j_start, i_end, j_end); in.close(); } }