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 is, int js, int ie, int je,int c,String s) {
        if(Math.abs(is-ie)%2!=0&&c==0)
        {
            System.out.println("Impossible");
        }
        else
        {if(c==0){
            while(js>je&&is>=ie+2)
            {
                s=s+"UL ";
                is=is-2;
                js=js-1;
                c=c+1;
            }
            while(is==ie&&js>=je+2)
            {    //System.out.println(c);
                s=s+"L ";
                js=js-2;
                c=c+1;
            }}
            if(c==0){
            while(js<je&&is>=ie+2)
            {
                s=s+"UR ";
                is=is-2;
                js=js+1;
                c=c+1;
            }
            while(is==ie&&js+2<=je)
            {    //System.out.println(c);
                s=s+"R ";
                js=js+2;
                c=c+1;
            }}
            if(c==0){
            while(js<je&&is+2<=ie)
            {
                s=s+"LR ";
                is=is+2;
                js=js+1;
                c=c+1;
            }
            while(is==ie&&js+2<=je)
            {    //System.out.println(c);
                s=s+"R ";
                js=js+2;
                c=c+1;
            }}
         if(c==0){
            while(js>je&&is+2<=ie)
            {
                s=s+"LL ";
                is=is+2;
                js=js-1;
                c=c+1;
            }
            while(is==ie&&js>=je+2)
            {    //System.out.println(c);
                s=s+"L ";
                js=js-2;
                c=c+1;
            }}
            if(c==0)
            {
                while(is<ie&&js==je)
                { 
                    if(c%2==0)
                        s=s+"UR ";
                    else
                        s=s+"UL ";
                        is=is+2;
                        c=c+1;
                }
            }
            if(c==0)
            {
                while(is>ie&&js==je)
                { 
                    if(c%2==0)
                        s=s+"LR ";
                    else
                        s=s+"LL ";
                        is=is-2;
                        c=c+1;
                }
            }
           
         /* if(js>je&&is>=ie+2)
            {
               //System.out.println(c);
                s=s+"UL ";
                printShortestPath(n,is-2,js-1,ie,je,c+1,s);
            }
            else if(is==ie&&js>=je+2)
            {    //System.out.println(c);
                s=s+"L ";
        printShortestPath(n,is,js-2,ie,je,c+1,s);}
        
        if(js<je&&is>ie+2)
            {
               //System.out.println(c);
                s=s+"UL ";
                printShortestPath(n,is+2,js-1,ie,je,c+1,s);
            }
            else if(is==ie&&js>=je+2)
            {    //System.out.println(c);
                s=s+"L ";
        printShortestPath(n,is,js-2,ie,je,c+1,s);}
        */}
        if(js==je&&is==ie)
            System.out.print(c+"\n"+s);
       // System.out.print(c+"\n"+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,0,"");
        in.close();
    }

}