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 pri[]={"UL","UR","R","LR","LL","L"};
        String par[][]=new String[n][n];
        int path[][]=new int[n][n];
        int dis[][]=new int[n][n];
        for(int i=0;i<n;i++)
            for(int j=0;j<n;j++)
                dis[i][j]=50000;
        dis[i_start][j_start]=0;
        par[i_start][j_start]="No";
        Queue<String> queue=new LinkedList<>();
        queue.add(i_start+","+j_start);

        while(queue.size()>0)
        {
            String pos[]=queue.poll().split(",");
            int i, j;
            i=Integer.parseInt(pos[0]);
            j=Integer.parseInt(pos[1]);
            //UL
            if(i-2>=0&&j-1>=0)
            {
                if(dis[i][j]+1<dis[i-2][j-1])
                {
                    dis[i-2][j-1]=dis[i][j]+1;
                    par[i-2][j-1]=i+","+j;
                    path[i-2][j-1]=0;
                    // if(i-2==i_end&&j-1==j_end)
                    //   break;
                    queue.add((i-2)+","+(j-1));
                }
            }
            //UR
            if(i-2>=0&&j+1<n)
            {
                if(dis[i][j]+1<dis[i-2][j+1])
                {
                    dis[i-2][j+1]=dis[i][j]+1;
                    par[i-2][j+1]=i+","+j;
                    path[i-2][j+1]=1;
                    //if(i-2==i_end&&j+1==j_end)
                    // break;
                    queue.add((i-2)+","+(j+1));
                }
            }
            //R
            if(i>=0&&j+2<n)
            {
                if(dis[i][j]+1<dis[i][j+2])
                {
                    dis[i][j+2]=dis[i][j]+1;
                    par[i][j+2]=i+","+j;
                    path[i][j+2]=2;
                    //if(i==i_end&&j+2==j_end)
                    //  break;
                    queue.add((i)+","+(j+2));
                }
            }
            //LR
            if(i+2<n&&j+1<n)
            {
                if(dis[i][j]+1<dis[i+2][j+1])
                {
                    dis[i+2][j+1]=dis[i][j]+1;
                    par[i+2][j+1]=i+","+j;
                    path[i+2][j+1]=3;
                    //if(i+2==i_end&&j+1==j_end)
                    // break;
                    queue.add((i+2)+","+(j+1));
                }
            }
            //LL
            if(i+2<n&&j-1>=0)
            {
                if(dis[i][j]+1<dis[i+2][j-1])
                {
                    dis[i+2][j-1]=dis[i][j]+1;
                    par[i+2][j-1]=i+","+j;
                    path[i+2][j-1]=4;
                    //if(i+2==i_end&&j-1==j_end)
                    // break;
                    queue.add((i+2)+","+(j-1));
                }
            }
            //L
            if(j-2>=0)
            {
                if(dis[i][j]+1<dis[i][j-2])
                {
                    dis[i][j-2]=dis[i][j]+1;
                    par[i][j-2]=i+","+j;
                    path[i][j-2]=5;
                    // if(i-2==i_end&&j==j_end)
                    //  break;
                    queue.add((i)+","+(j-2));
                }
            }

        }
       
        int p=i_end,q=j_end;
            if(dis[i_end][j_end]==50000)
            {
                System.out.print("Impossible");
                return;
            }
             System.out.println(dis[i_end][j_end]);
        Stack<Integer> stack=new Stack();
        while(p!=i_start||q!=j_start)
            {
               // str.append(path[p][q]);
                stack.push(path[p][q]);
                String str1[]=par[p][q].split(",");
                p=Integer.parseInt(str1[0]);
                q=Integer.parseInt(str1[1]);
            }
            while(stack.size()>0)
            {
                System.out.print(pri[stack.pop()]+" ");
            }
            

    }


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