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) 
    {
        boolean flag=true;
        String w="";
        int steps=0;
        int c=0;
        int i=i_start,j=j_start;
        int vert=0,req=0,already=0,dif=0;
        vert=Math.abs(i_end-i_start);
        req=Math.abs(j_end-j_start);
        if (vert%2!=0)
            flag=false;
        else
        {
            already=vert/2;
            dif=req-already;
            if (dif%2!=0)
                flag=false;
            else
            {
                while ((i_start==i_end) && (j_start==j_end))
                {
                    if ((i_end<i_start) && (j_end<j_start))
                    {
                        i_start-=2;
                        j_end--;
                    }
                    if ((i_end<i_start) && (j_end<j_start))
                    {
                        i_start-=2;
                        j_end--;
                    }
                }
            }
            
            
        }
        if (flag==false)
            System.out.println("Impossible");
        
        else
        {
        while(true)
        {
            if ((i<0) || (j<0) || (i>=n) || (j>=n))
                break;
            
            if ((i==i_end) && (j==j_end))
                break;
            
            if (i_end<i)
            {
                i=i-2;
                if (j_end<=j)
                {
                    --j;                    
                    w=w+"UL ";
                    c++;
                    continue;
                }
                else
                {
                    ++j;
                    w=w+"UR ";
                    c++;
                    continue;

                }
            }
            
            if (i_end>i)
            {
                i=i+2;
                if (j_end<j)
                {
                    --j;
                    w=w+"LL ";
                    c++;
                    continue;

                }
                else
                {
                    ++j;
                    w=w+"LR ";
                    c++;
                    continue;

                }
                
            }
            
            if (i==i_end)
            {
                if (j_end<j)
                {
                    j=j-2;
                    w=w+"L ";
                    c++;
                    continue;

                }
                else
                {
                    j=j+2;
                    w=w+"R ";
                    c++;
                    continue;

                }
            }        
            
        }
            
            System.out.println(c);
            System.out.println(w);
        }
        
    }

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