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.
        int vert_dist = i_end - i_start;
        int hori_dist = j_end - j_start;
       /* if(vert_dist<0){
            vert_dist*=-1;
        }
        if(hori_dist<0){
            hori_dist*=-1;
        } */
        // UL, UR, R, LR, LL, L
        int steps = 0;
        String result = new String("");
        
        while(vert_dist != 0 || hori_dist != 0){
            if(vert_dist%2!=0){
            System.out.println("Impossible");
            System.exit(0);
        }else if(vert_dist==2 && hori_dist==0){
            System.out.println("Impossible");
            System.exit(0);
        }
            
            if(vert_dist>0){
                if(hori_dist>0){
                    i_start+=2;
                    j_start+=1;
                    vert_dist = i_end - i_start;
                    hori_dist = j_end - j_start;
                    steps+=1;
                    result=result.concat("LR ");
                    continue;
                }else if(hori_dist<0){
                    i_start+=2;
                    j_start+=-1;
                    vert_dist = i_end - i_start;
                    hori_dist = j_end - j_start;
                    steps+=1;
                    result=result.concat("LL ");
                    continue;
                }else{
                    i_start+=2;
                    j_start+=1;
                    vert_dist = i_end - i_start;
                    hori_dist = j_end - j_start;
                    steps+=1;
                    result=result.concat("LR ");
                    continue;
                }
            }else if(vert_dist<0){
                if(hori_dist>0){
                    i_start-=2;
                    j_start+=1;
                    vert_dist = i_end - i_start;
                    hori_dist = j_end - j_start;
                    steps+=1;
                    result=result.concat("UR ");
                    continue;
                }else if(hori_dist<0){
                    i_start-=2;
                    j_start-=1;
                    vert_dist = i_end - i_start;
                    hori_dist = j_end - j_start;
                    steps+=1;
                    result=result.concat("UL ");
                    continue;
                }else{
                    i_start-=2;
                    j_start-=1;
                    vert_dist = i_end - i_start;
                    hori_dist = j_end - j_start;
                    steps+=1;
                    result=result.concat("UL ");
                    continue;
                }
            }else{
                if(hori_dist>0){
                    j_start+=2;
                    steps+=1;
                    vert_dist = i_end - i_start;
                    hori_dist = j_end - j_start;
                    result=result.concat("R ");
                    continue;
                }else if(hori_dist<0){
                    j_start-=2;
                    vert_dist = i_end - i_start;
                    hori_dist = j_end - j_start;
                    steps+=1;
                    result=result.concat("L ");
                    continue;
                }
                /* else{
                    
                } */
            }
        }
        
        System.out.println(steps);
        System.out.println(result);
        
    }

    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();
        if(n<5 || n>200){
            System.exit(0);
        }
        int arr_temp[] = {i_start, j_start, i_end, j_end};
        for(int i=0;i<4;i++){
            if(arr_temp[i]<0 || arr_temp[i]>=n){
                System.exit(0);
            }
        }
        if(i_start == j_start && i_end == j_end){
            System.exit(0);
        }
        printShortestPath(n, i_start, j_start, i_end, j_end);
        in.close();
    }
}