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_s, int j_s, int i_e, int j_e) {
        //  Print the distance along with the sequence of moves.
        if(i_s<n||j_s<n||i_s>=0||j_s>=0){
        if(i_s!=i_e||j_s!=j_e){
            if(i_s>i_e&&j_s>=j_e){
                s=s+"UL ";
                i_s=i_s-2;
                j_s=j_s-1;k++;
                if((i_s==i_e+1||i_s==i_e-1)||(i_s==i_e&&j_s==j_e+1)||(i_s==i_e&&j_s==j_e-1)){
                k=0;s="Impossible";}
                else{
                printShortestPath(n,i_s,j_s,i_e,j_e);}
            }
            else if(i_s>i_e&&j_s<j_e){
                s=s+"UR ";
                  i_s=i_s-2;
                 j_s=j_s+1;
                k++;
                  if((i_s==i_e+1||i_s==i_e-1)||(i_s==i_e&&j_s==j_e+1)||(i_s==i_e&&j_s==j_e-1)){
                     k=0;s="Impossible";}
                else{
                printShortestPath(n,i_s,j_s,i_e,j_e);}
            }
            else if(i_s==i_e&&j_s<j_e){
                s=s+"R ";
                j_s+=2;
                k++;
                                if((i_s==i_e+1||i_s==i_e-1)||(i_s==i_e&&j_s==j_e+1)||(i_s==i_e&&j_s==j_e-1)){
                     k=0;s="Impossible";}
                else{
                printShortestPath(n,i_s,j_s,i_e,j_e);}
            }
            else if(i_s<i_e&&j_s<=j_e){
                   s=s+"LR ";
                i_s=i_s+2;
                j_s=j_s+1;
                k++;
                              if((i_s==i_e+1||i_s==i_e-1)||(i_s==i_e&&j_s==j_e+1)||(i_s==i_e&&j_s==j_e-1)){
                     k=0;s="Impossible";}
                else{
                printShortestPath(n,i_s,j_s,i_e,j_e);}
            }
            else if(i_s<i_e&&j_s>j_e){
                s=s+"LL ";
                                i_s=i_s+2;
                j_s=j_s-1;
                k++;
                              if((i_s==i_e+1||i_s==i_e-1)||(i_s==i_e&&j_s==j_e+1)||(i_s==i_e&&j_s==j_e-1)){
                     k=0;s="Impossible";}
                else{
                printShortestPath(n,i_s,j_s,i_e,j_e);}
            }
            else if(i_s==i_e&&j_s>j_e){
                s=s+"L ";
                j_s-=2;
                k++;
                                if((i_s==i_e+1||i_s==i_e-1)||(i_s==i_e&&j_s==j_e+1)||(i_s==i_e&&j_s==j_e-1)){
                     k=0;s="Impossible";}
                else{
                printShortestPath(n,i_s,j_s,i_e,j_e);}
            }
            
        }
        }
        else
            s="Impossible";
    }
    static String s="";
    static int k=0;
    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);
        if(k!=0)
        System.out.println(k);
        System.out.println(s);
        in.close();
    }
}