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) { ArrayList path = new ArrayList(); int i=i_start; int j=j_start; int flag=0; while(i!=i_end || j!=j_end) { if((i_end==i+1 || i_end==i-1) && (j_end==j+1 || j_end==j-1)) {System.out.println("Impossible");flag=1; break;} if(i_endi && j_end>j) { i=i+2; j=j+1; path.add("LR"); } else if(i_end==i && j_end>j) { j=j+2; path.add("R"); } else if(i_end==i && j_endi && j_end==j) { if(j+1>=n) { i=i+2; j=j-1; path.add("LL"); } else { i=i+2; j=j+1; path.add("LR"); } } else if(i_endi && j_endj) { i=i-2; j=j+1; path.add("UR"); } } if (flag==0) { System.out.println(path.size()); System.out.println(path.toString().replace("[", "").replace("]", "").replace(",", "")); } } 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(); } }