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

public class Solution {

    public 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 counter=0;
        StringBuffer sb = new StringBuffer();
        if(i_start%2 != i_end%2)
            System.out.print("Impossible");
        else if( Math.abs(i_end - i_start)%4 == 0 && (j_start%2 != j_end%2) )
            System.out.print("Impossible");
        else if( Math.abs(i_end - i_start)%4 != 0 && (j_start%2 == j_end%2) )
            System.out.print("Impossible");
        else{
            int diffX = i_end - i_start;
            int diffY = j_end - j_start;
            while(diffX != 0){
                if(diffX > 0 && diffY < 0){
                    diffY+=1; diffX-=2;
                    sb.append("LL ");counter++;
                }else if(diffX < 0 && diffY > 0){
                    diffY-=1; diffX+=2;
                    sb.append("UR ");counter++;
                }else if(diffX < 0 && diffY < 0){
                    diffY+=1; diffX+=2;
                    sb.append("UL ");counter++;
                }else if(diffX<0 && diffY==0){
                    diffY+=1; diffX+=2;
                    sb.append("UL ");counter++;
                }else if(diffX>0 && diffY==0){
                    diffY-=1; diffX-=2;
                    sb.append("LR ");counter++;
                }                    
            }
            while(diffY !=0){
                if(diffY>0){
                    diffY-=2;
                    sb.append("R ");counter++;
                }else{
                    diffY+=2;
                    sb.append("L ");counter++;
                }
            }
            System.out.println(counter);
            System.out.println(sb.toString());
        }
        
    }

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