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

public class Solution {
    static int[][] array;
    static String shortestPath;
    static int shortestInt;
    static int arrayLength;
    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.
        arrayLength = n;
        if(i_start<0||j_start<0||i_end<0||j_end<0||i_start>=n||j_start>=n||i_end>n||j_end>=n)
        {
            System.out.println("Impossible");
        }
        else
        {
            array = new int[n][n];
            for(int i = 0;i<n;i++)
            {
                for(int j = 0;j<n;j++)
                {
                    array[i][j]=Integer.MAX_VALUE;
                }
            }
            shortCalc(1,"L",i_start,j_start-2,i_end,j_end);//L
            shortCalc(1,"R",i_start,j_start+2,i_end,j_end);//R
            shortCalc(1,"UL",i_start-2,j_start-1,i_end,j_end);//UL
            shortCalc(1,"UR",i_start-2,j_start+1,i_end,j_end);//UR
            shortCalc(1,"LR",i_start+2,j_start+1,i_end,j_end);//LR
            shortCalc(1,"LL",i_start+2,j_start-1,i_end,j_end);//LL
            if(shortestInt>0)
            {
                System.out.println(shortestInt);
                System.out.println(shortestPath);
            }
            else
            {
                System.out.println("Impossible");
            }
        }
        
    }
    public static void shortCalc(int step, String path, int i_start, int j_start, int i_end, int j_end)
    {
        if(i_start<0||j_start<0||i_end<0||j_end<0||i_start>=arrayLength||j_start>=arrayLength||i_end>=arrayLength||j_end>=arrayLength)
        {
            return;
        }
        if(step>array[i_start][j_start])
        {
            return;
        }
        else
        {
            if(i_start==i_end&&j_start==j_end)
            {
                if(step==array[i_start][j_start])
                {
                    Scanner scan1 = new Scanner(shortestPath);
                    Scanner scan2 = new Scanner(path);
                    for(int i = 0;i<step;i++)
                    {
                        String spString = scan1.next();
                        int spStringInt=0;
                        String pString = scan2.next();
                        int pStringInt=0;
                        if(spString.equals(pString))
                        {
                            
                        }
                        else
                        {
                            if(spString.equals("UL"))
                            {
                                spStringInt = 1;
                            }
                            if(spString.equals("UR"))
                            {
                                spStringInt = 2;
                            }
                            if(spString.equals("R"))
                            {
                                spStringInt = 3;
                            }
                            if(spString.equals("LR"))
                            {
                                spStringInt = 4;
                            }
                            if(spString.equals("LL"))
                            {
                                spStringInt = 5;
                            }
                            if(spString.equals("L"))
                            {
                                spStringInt = 6;
                            }
                            if(pString.equals("UL"))
                            {
                                pStringInt = 1;
                            }
                            if(pString.equals("UR"))
                            {
                                pStringInt = 2;
                            }
                            if(pString.equals("R"))
                            {
                                pStringInt = 3;
                            }
                            if(pString.equals("LR"))
                            {
                                pStringInt = 4;
                            }
                            if(pString.equals("LL"))
                            {
                                pStringInt = 5;
                            }
                            if(pString.equals("L"))
                            {
                                pStringInt = 6;
                            }
                            if(pStringInt>spStringInt)
                            {
                                return;
                            }
                            else if(pStringInt<spStringInt)
                            {
                                shortestPath = path;
                                shortestInt = step;
                                array[i_start][j_start]=step;
                                return;
                            }
                            
                        }
                        
                        
                    }
                }
                //UL, UR, R, LR, LL, L. Order of operations.
                //UL,1,UR,2,R,3,LR,4,LL,5,L,6
                shortestPath = path;
                shortestInt = step;
                array[i_start][j_start]=step;
                return;
            }
            array[i_start][j_start]=step;
            shortCalc(step+1,path+" L",i_start,j_start-2,i_end,j_end);//L
            shortCalc(step+1,path+" R",i_start,j_start+2,i_end,j_end);//R
            shortCalc(step+1,path+" UL",i_start-2,j_start-1,i_end,j_end);//UL
            shortCalc(step+1,path+" UR",i_start-2,j_start+1,i_end,j_end);//UR
            shortCalc(step+1,path+" LR",i_start+2,j_start+1,i_end,j_end);//LR
            shortCalc(step+1,path+" LL",i_start+2,j_start-1,i_end,j_end);//LL
            
        }
        
        
    }

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