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.
        int i=i_start,j=j_start;
        String s="";
        int cnt=0;
        
        while(true)
        {
            //System.out.println("i:"+i+" j:"+j);
            if(i-2>=0&&j-1>=0&&i-2>=i_end&&j-1>=j_end&&i_end<=i_start&&j_end<=j_start)
            {
                i=i-2;
                j=j-1;
                cnt++;
                s+="UL ";
            }
            else
                break;
        }
        //System.out.println("i:"+i+" j:"+j);
        if(i==i_end&&j==j_end)
        {
            System.out.println(cnt+"\n"+s);
            return;
        }
        
        while(true)
        {
            if(i-2>=0&&j+1<n&&i-2>=i_end&&j+1<=j_end&&i_end<=i_start&&j_end>=j_start)
            {
                i=i-2;
                j=j+1;
                cnt++;
                s+="UR ";
            }
            else
                break;
        }
        if(i==i_end&&j==j_end)
        {
            System.out.println(cnt+"\n"+s);
            return;
        }
        while(true)
        {
            if(j+2<n&&j+2<=j_end&&j_start<=j_end)
            {
                j=j+2;
                cnt++;
                s+="R ";
            }
            else
                break;
        }
        if(i==i_end&&j==j_end)
        {
            System.out.println(cnt+"\n"+s);
            return;
        }
        while(true)
        {
            if(i+2<n&&j+1<n&&i+2<=i_end&&j+1<=j_end&&i_end>=i_start&&j_end>=j_start)
            {
                i=i+2;
                j=j+1;
                cnt++;
                s+="LR ";
            }
            else
                break;
        }
        if(i==i_end&&j==j_end)
        {
            System.out.println(cnt+"\n"+s);
            return;
        }
        while(true)
        {
            if(i+2<n&&j-1>=0&&i+2<=i_end&&j-1>=j_end&&i_end>=i_start&&j_end<=j_start)
            {
                i=i+2;
                j=j-1;
                cnt++;
                s+="LL ";
            }
            else
                break;
        }
        if(i==i_end&&j==j_end)
        {
            System.out.println(cnt+"\n"+s);
            return;
        }
        while(true)
        {
            if(j-2>=0&&j-2<=j_end&&j_start>=j_end)
            {
                j=j-2;
                cnt++;
                s+="L ";
            }
            else
                break;
        }
        if(i==i_end&&j==j_end)
        {
            System.out.println(cnt+"\n"+s);
            return;
        }
        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();
    }
}