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) {
        int counter = 0;
        String resString = "";
        while(!(i_start==i_end && j_start==j_end)){
            if( (i_start+i_end) % 2 == 1 || ((i_start+i_end) % 4 != 0 && (j_start==j_end)) || (Math.abs(i_start-i_end)<2 && Math.abs(j_start-j_end)==1)){
            System.out.println("Impossible");
            return;
            }
            //priority UL, UR, R, LR, LL, L
            
            if(i_start>i_end && j_start<j_end){
                    resString += (resString == "")?"UR":" UR";
                    counter += 1;
                    i_start -= 2;
                    j_start += 1;
                
            }
            else if(i_start>i_end && j_start >= j_end){
                if(j_start-1>=0){
                    resString += (resString == "")?"UL":" UL";
                    counter += 1;
                    i_start -= 2;
                    j_start -= 1;
                }else{
                    resString += (resString == "")?"UR":" UR";
                    counter += 1;
                    i_start -= 2;
                    j_start += 1;
                }
                
            }
            else if(j_start < j_end ){
                if(!(i_end-i_start==2 && Math.abs(j_start-j_end)==1)){
                    resString += (resString == "")?"R":" R";
                    counter += 1;
                    j_start += 2;
                }else if(j_start-j_end==-1){ //on va LR
                    resString += (resString == "")?"LR":" LR";
                    counter += 1;
                    i_start += 2;
                    j_start += 1;
                }else{ //on va LL
                    resString += (resString == "")?"LL":" LL";
                    counter += 1;
                    i_start += 2;
                    j_start -= 1;
                }
            }
            else if(i_start<i_end && j_start <= j_end){
                if(j_start+1<n){
                    resString += (resString == "")?"LR":" LR";
                    counter += 1;
                    i_start += 2;
                    j_start += 1;   
                }else
                {
                   resString += (resString == "")?"LL":" LL";
                    counter += 1;
                    i_start += 2;
                    j_start -= 1; 
                }
               
            }
            else if(i_start<i_end && j_start > j_end){
                resString += (resString == "")?"LL":" LL";
                counter += 1;
                i_start += 2;
                j_start -= 1;
                
            }
            else if(i_start==i_end && j_start > j_end ){
                resString += (resString == "")?"L":" L";
                counter += 1;
                j_start -= 2;
            }
            else{ //ERREUR
                resString += "??(i_s"+i_start+"i_e"+i_end+", j_start"+j_start+"j_e"+j_end+")";
                System.out.println(counter+"\n"+resString);
            }
            
        }
        System.out.println(counter+"\n"+resString);
    }

    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();
    }
} //priority UL, UR, R, LR, LL, L