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

public class Solution {
    static int nt=0;
    static String s="";
    static void printShortestPath(int n, int xs, int ys, int xe, int ye) {
        //  Print the distance along with the sequence of moves.
        if(nt>=n){
            System.out.println("Impossible");
        }else{
            s=s+" ";
            if((xs<xe)&&(ys>ye)){
                //Right Top Zone (Destination Point)
                if((xs+1==xe)&&(ys-2==ye)){
                    s=s+"UR";
                    nt++;
                    s = s.replaceFirst("^ *", "");
                    System.out.println(nt+"\n"+s);
                }
                else if((((xs+1)==xe)&&((ys-1)==ye))||(((xs+2)==xe)&&((ys-2)==ye))||(((xs+1)==xe)&&((ys-2)==ye))){
                    System.out.println("Impossible");
                }
                else {
                    s=s+"UR";
                    nt++;
                    printShortestPath(n,xs+1,ys-2,xe,ye);
                }
            }else if((xs<xe)&&(ys<ye)){
                //Right Bottom Zone (Destination Point)
                if((xs+1==xe)&&(ys+2==ye)){
                    s=s+"LR";
                    nt++;
                    s = s.replaceFirst("^ *", "");
                    System.out.println(nt+"\n"+s);
                }
                else if((((xs+1)==xe)&&((ys+1)==ye))||(((xs+2)==xe)&&((ys+2)==ye))||(((xs+1)==xe)&&((ys+2)==ye))){
                    System.out.println("Impossible");
                }else{
                    nt++;
                    s=s+"UR";
                    printShortestPath(n,xs+1,ys-2,xe,ye);
                }

            }else if((xs>xe)&&(ys>ye)){
                //Left Top Zone (Destination Point)
                if((xs-1==xe)&&(ys-2==ye)){
                    nt++;
                    s=s+"UL";
                    s = s.replaceFirst("^ *", "");
                    System.out.println(n+"\n"+s);
                }
                else if((((xs-1)==xe)&&((ys-1)==ye))||(((xs-2)==xe)&&((ys-2)==ye))||(((xs-1)==xe)&&((ys-2)==ye))){
                    System.out.println("Impossible");
                }else{
                    s=s+"UL";
                    nt++;
                    printShortestPath(n,xs-1,ys-2,xe,ye);
                }

            }else if((xs>xe)&&(ys<ye)){
                //Left Bottom Zone (Destination Point)
                if((xs-1==xe)&&(ys+2==ye)){
                    s=s+"LL";
                    nt++;
                    s = s.replaceFirst("^ *", "");
                    System.out.println(nt+"\n"+s);
                }
                else if((((xs-1)==xe)&&((ys+1)==ye))||(((xs-2)==xe)&&((ys+2)==ye))||(((xs-1)==xe)&&((ys+2)==ye))){
                    System.out.println("Impossible");
                }else{
                    s=s+"LL";
                    nt++;
                    printShortestPath(n,xs+1,ys+2,xe,ye);
                }

            }else if(ys==ye){
                if(xs>xe){
                    if(xs-1==xe){
                        System.out.print("Impossible");
                    }else if(xs-2==xe){
                        nt++;
                        s=s+"L";
                        s = s.replaceFirst("^ *", "");
                        System.out.println(nt+"\n"+s);
                    }else{
                       nt++;
                       s=s+"L";
                       printShortestPath(n,xs-2,ys,xe,ye);
                    }
                }else if(xs<xe){
                   if(xs+1==xe){
                        System.out.print("Impossible");
                    }else if(xs+2==xe){
                        nt++;
                        s=s+"R";
                        s = s.replaceFirst("^ *", "");
                        System.out.println(nt+"\n"+s);
                    }else{
                       nt++;
                       printShortestPath(n,xs+2,ys,xe,ye);
                    } 
                }
            }else if(xs==xe){
                if(((ys+4)==ye)&&((ys+4)<7)){
                    s=s+"LR";
                    nt++;
                    printShortestPath(n,xs+1,ys+2,xe,ye);   
                }else{
                    System.out.print("Impossible");
                }
            }
        }
    }

    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, j_start, i_start, j_end, i_end);
        in.close();
    }
}