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) { // Print the distance along with the sequence of moves. if(i_start>i_end && j_start>j_end){ if((i_start-i_end)%2 == 0){ int x_diff = i_start-i_end; int y_diff = j_start-j_end; int dig_move = x_diff/2; if((y_diff-dig_move)%2==0 && (y_diff-dig_move)>=0){ int strgt_move = (y_diff-dig_move)/2; System.out.println(dig_move+strgt_move); for(int i = 0; i< dig_move; i++ ) System.out.print("UL"+" "); for(int i = 0; i< strgt_move; i++ ) System.out.print("L"+" "); }else if((y_diff-dig_move)%2==0){ int dig2_move = (dig_move - y_diff)/2; System.out.println(dig_move); for(int i = 0; i< (dig_move-dig2_move); i++ ) System.out.print("UL"+" "); for(int i = 0; i< dig2_move; i++ ) System.out.print("UR"+" "); }else{ System.out.println("Impossible"); } }else{ System.out.println("Impossible"); } } else if(i_start>i_end && j_start=0){ int strgt_move = (y_diff-dig_move)/2; System.out.println(dig_move+strgt_move); for(int i = 0; i< dig_move; i++ ) System.out.print("UR"+" "); for(int i = 0; i< strgt_move; i++ ) System.out.print("R"+" "); }else if((y_diff-dig_move)%2==0){ int dig2_move = (dig_move - y_diff)/2; System.out.println(dig_move); for(int i = 0; i< dig2_move; i++ ) System.out.print("UL"+" "); for(int i = 0; i< (dig_move-dig2_move); i++ ) System.out.print("UR"+" "); }else{ System.out.println("Impossible"); } }else{ System.out.println("Impossible"); } } else if(i_start=0){ int strgt_move = (y_diff-dig_move)/2; System.out.println(dig_move+strgt_move); for(int i = 0; i< strgt_move; i++ ) System.out.print("R"+" "); for(int i = 0; i< dig_move; i++ ) System.out.print("LR"+" "); }else if((y_diff-dig_move)%2==0){ int dig2_move = (dig_move - y_diff)/2; System.out.println(dig_move); for(int i = 0; i< (dig_move-dig2_move); i++ ) System.out.print("LR"+" "); for(int i = 0; i< dig2_move; i++ ) System.out.print("LL"+" "); }else{ System.out.println("Impossible"); } }else{ System.out.println("Impossible"); } } else if(i_startj_end){ if((i_end-i_start)%2 == 0){ int x_diff = i_end-i_start; int y_diff = j_start-j_end; int dig_move = x_diff/2; if((y_diff-dig_move)%2==0 && (y_diff-dig_move)>=0){ int strgt_move = (y_diff-dig_move)/2; System.out.println(dig_move+strgt_move); for(int i = 0; i< dig_move; i++ ) System.out.print("LL"+" "); for(int i = 0; i< strgt_move; i++ ) System.out.print("L"+" "); }else if((y_diff-dig_move)%2==0){ int dig2_move = (dig_move - y_diff)/2; System.out.println(dig_move); for(int i = 0; i< dig2_move; i++ ) System.out.print("LR"+" "); for(int i = 0; i< (dig_move-dig2_move); i++ ) System.out.print("LL"+" "); }else{ System.out.println("Impossible"); } }else{ System.out.println("Impossible"); } } else if(i_start == i_end){ if(j_start< j_end){ if((j_end-j_start)%2==0){ int strgt_move = j_end-j_start; System.out.println(strgt_move); for(int i = 0; i< strgt_move; i++ ) System.out.print("R"+" "); }else{ System.out.println("Impossible"); } }else{ if((j_start-j_end)%2==0){ int strgt_move = j_start-j_end; System.out.println(strgt_move); for(int i = 0; i< strgt_move; i++ ) System.out.print("L"+" "); }else{ System.out.println("Impossible"); } } } else if(j_start == j_end){ if(i_start > i_end){ if((i_start - i_end)%4 == 0){ int dig_move = (i_start - i_end)/4; System.out.println(2*dig_move); for(int i = 0; i< dig_move; i++ ) System.out.print("UL"+" "+"UR"+" "); }else{ System.out.println("Impossible"); } }else{ if((i_end - i_start)%4 == 0){ int dig_move = (i_end - i_start)/4; System.out.println(2*dig_move); for(int i = 0; i< dig_move; i++ ) System.out.print("LR"+" "+"LL"+" "); }else{ System.out.println("Impossible"); } } } /* if((i_start-i_end)%2 == 0){ int x_diff = i_start-i_end; int y_diff = j_start-j_end; int dig_move = x_diff/2; if((y_diff-dig_move)%2==0){ int strgt_move = (y_diff-dig_move)/2; System.out.println(dig_move+strgt_move); }else{ System.out.println("Impossible"); } }else { 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(); } }