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 minMoves = 0;
        int i = i_start;
        int j = j_start;
        List<String> seqMoves = new ArrayList<>(); 
        while((i!=i_end) || (j!=j_end)){
            if(Math.abs(i-i_end)%2 !=0){
                System.out.println("Impossible");
                break;
            }
            if((i>i_end) && (j>=j_end)){
                seqMoves.add("UL");
                minMoves++;
                i = i-2;
                j = j-1;
            } else if((i>i_end) && (j<=j_end)){
                seqMoves.add("UR");
                minMoves++;
                i = i-2;
                j = j+1;
            } else if((j<j_end) && (i==i_end)){                
                seqMoves.add("R");
                minMoves++;
                j = j+2;
            } else if((i<i_end) && (j<=j_end)){
                seqMoves.add("LR");
                minMoves++;
                i = i+2;
                j = j+1;                                
            } else if((i<i_end) && (j>=j_end)){
                seqMoves.add("LL");
                minMoves++;
                i = i+2;
                j = j-1;
            }else if((j>j_end) && (i==i_end)){
                seqMoves.add("L");
                minMoves++;
                j = j-2;
            } 
        }        
      
        if((i==i_end)&&(j==j_end)){
            System.out.println(minMoves);
            for(String s: seqMoves){
                System.out.print(s+ " ");
           }    
        }
        
    }

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