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.
        String[] moves=new String[100];
        int top=0,flag=1;
        int is=i_start,js=j_start;
        do
        {
            if(is<i_end)
            {
                if(is!=i_end-1)
                {
                   if(js<j_end)
                   {
                       moves[top++]="LR";
                        is=is+2;
                        js=js+1;
                        flag=1;
                     }
                    else if(js>j_end)
                    {
                       moves[top++]="LL";
                        is=is+2;
                        js=js-1;
                        flag=1;
                    }
                    else
                      {
                         flag=0;
                      }
                }
                else
                {
                    flag=0;
                }
            }
            else if(is>i_end)
            {
                if(is!=i_end+1)
                {    
                if(js<j_end)
                {
                    moves[top++]="UR";
                    is=is-2;
                    js=js+1;
                    flag=1;
                }
                else if(js>j_end)
                {
                    moves[top++]="UL";
                    is=is-2;
                    js=js-1;
                    flag=1;
                }
                else
                {
                    flag=0;
                }
                }  
                else
                {
                    flag=0;
                }
            }
            else
            {
                if(js<j_end)
                {
                    if(js!=j_end-1)
                    {
                        moves[top++]="R";
                        js=js+2;
                        flag=1;
                    }
                    else
                    {
                        flag=0;
                    }
                }
                else if(js>j_end)
                {
                    if(js!=j_end+1)
                    {
                        moves[top++]="L";
                        js=js-2;
                        flag=1;
                    }
                    else
                    {
                        flag=0;
                    }
                }
                else
                {
                    flag=0;
                }
            }
            if(js==j_end)
            {
                if(is<i_end)
                {
                    moves[top++]="LR";
                    is=is+2;
                    js=js+1;
                    flag=1;
                }
                else if(is>i_end)
                {
                    moves[top++]="UL";
                    is=is-2;
                    js=js-1;
                    flag=1;
                }
                else
                {
                    flag=0;
                }
            }
        }while(flag==1);
        if((is==i_end) && (js==j_end))
        {
            System.out.printf("%d\n",top);
            for(int i=0;i<top;i++)
            {
                System.out.printf("%s ",moves[i]);
            }
        }
        else
        {
            System.out.println("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, i_start, j_start, i_end, j_end);
        in.close();
    }
}