import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static int count = 0;
	static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end,StringBuilder sb) {
        if(i_start == i_end && j_start == j_end){
               System.out.println(count);
               if(sb.length() > 0){
                   sb.setLength(sb.length()-1);
               }
               System.out.println(sb);
               return;
       }
       else if(i_start>i_end && j_start+1>=j_end && i_start-2>=i_end){
           if(j_start>0 && (i_start- 2 > i_end || j_start-1>=j_end)){
               count++;
               sb.append("UL ");
               printShortestPath(n, i_start-2, j_start-1, i_end, j_end,sb);
               return;
           }else{
               count++;
               sb.append("UR ");
               printShortestPath(n, i_start-2, j_start+1, i_end, j_end,sb); 
               return;
           }
       }
       else if(i_start>i_end && j_start<j_end){
           count++;
           sb.append("UR ");
           printShortestPath(n, i_start-2, j_start+1, i_end, j_end,sb);
           return;
       }
       else if(j_start+2<j_end ||  (j_start+2 == j_end && i_start == i_end)){
           count++;
           sb.append("R ");
           printShortestPath(n, i_start, j_start+2, i_end, j_end,sb);
           return;
       }
       else if(j_start <= j_end+1){
           if(j_start+1<n && (i_start+ 2 < i_end || j_start+1<=j_end)){
               count++;
               sb.append("LR ");
               printShortestPath(n, i_start+2, j_start+1, i_end, j_end,sb);
               return;
           }else{
               count++;
               sb.append("LL ");
               printShortestPath(n, i_start+2, j_start-1, i_end, j_end,sb);
               return;
           }
       }
       else if(i_end > i_start){
           count++;
           sb.append("LL ");
           printShortestPath(n, i_start+2, j_start-1, i_end, j_end,sb);
           return;
       }else{
           count++;
           sb.append("L ");
           printShortestPath(n, i_start, j_start-2, i_end, j_end,sb);
           return;
       }

   }

   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();
       in.close();
       if(Math.abs(i_end - i_start)%2 == 1){
           System.out.println("Impossible");
           return;
       }
       if((Math.abs(i_end-i_start)%4 == 0)&&(Math.abs(j_end-j_start)%2 == 1)){
           System.out.println("Impossible");
           return;
       }
       if((Math.abs(i_end-i_start)%4 == 2)&&(Math.abs(j_end-j_start)%2 == 0)){
           System.out.println("Impossible");
           return;
       }
       StringBuilder sb = new StringBuilder();
       printShortestPath(n, i_start, j_start, i_end, j_end, sb);
   }

}