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.
        ArrayList<String> comm = new ArrayList<String>();
        if((i_start - i_end)%4 != 0 && (j_start - j_end)%2 != 0){
            System.out.println("Impossible");
        }
        else if((i_start - i_end)%2 != 0 && (j_start - j_end)%2 != 1){
            System.out.println("Impossible");
        }
        else if(i_start < i_end){
            
              while(i_start != i_end){
                  if(j_start <= j_end){
                      j_start++;
                      i_start += 2;
                      comm.add("LR");
                  }else{
                      j_start--;
                      i_start += 2;
                      comm.add("LL");
                  }
              }
            while(j_start != j_end){
                  if(j_start <= j_end){
                      j_start+=2;
                     
                      comm.add("R");
                  }else{
                      j_start-=2;
                      
                      comm.add("L");
            }
        }
        
    }
         else if(i_start > i_end){
            
              while(i_start != i_end){
                  if(j_start <= j_end){
                      j_start++;
                      i_start -= 2;
                      comm.add("UR");
                  }else{
                      j_start--;
                      i_start -= 2;
                      comm.add("UL");
                  }
              }
            while(j_start != j_end){
                  if(j_start <= j_end){
                      j_start+=2;
                     
                      comm.add("R");
                  }else{
                      j_start-=2;
                      
                      comm.add("L");
            }
        }
        
    }
        //else if(j_start == j_end){
            // while(i_start != i_end){
            //     for( int i = (i_end - i_start), i >= - (i_end - i_start); )
             //    i_start += (i_end - i_start);
             //}
         //}
        if(comm.size() != 0) System.out.println(comm.size());
        for(String com : comm){
            System.out.print(com + " ");
        }
    }

    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();
    }
}