import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
public class Solution {
    static List<String> al=new ArrayList<String>();
    static int count=0;
    static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
        if(i_start==i_end && j_start==j_end)
        {
            System.out.println(count);
            Iterator<String> itr=al.iterator();
            while(itr.hasNext())
            {
                System.out.print(itr.next() +" ");
            }
        }
        else if(count==n)
        {
            System.out.println("Impossible");
        }
        else if(i_start>i_end)
        {
            if(j_start>j_end)
            {
                count++;
                al.add("UL");
                printShortestPath(n,i_start-2,j_start-1,i_end,j_end);
            }
            else
            {
                count++;
                al.add("UR");
                printShortestPath(n,i_start-2,j_start+1,i_end,j_end);                
            }
        }
        else if(i_start==i_end)
        {
            if(j_start<j_end)
            {
                count++;
                al.add("R");
                printShortestPath(n,i_start,j_start+2,i_end,j_end);
            }
            else
            {
                count++;
                al.add("L");
                printShortestPath(n,i_start,j_start-2,i_end,j_end);
            }
        }
        else
        {
            if(j_start<=j_end)
            {
                count++;
                al.add("LR");
                printShortestPath(n,i_start+2,j_start+1,i_end,j_end);
            }
            else
            {
                count++;
                al.add("LL");
                printShortestPath(n,i_start+2,j_start-1,i_end,j_end);
            }
        }
        //  Print the distance along with the sequence of moves.
    }
    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();
    }
}