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 istart, int jstart, int iend, int jend) 
    {
        String s="";
        int count=0;
        while(true)
        {
            if(istart==iend&&jstart==jend)
            {
                System.out.println(count);
                System.out.println(s);
                break;
            }    
            else if(istart>=n||jstart>=n||istart<0||jstart<0||(istart+1==iend&&jstart==jend)||(istart-1==iend&&jstart==jend)||(jstart+1==jend&&istart==iend)||(jstart-1==jend&&istart==iend))
            {
                System.out.println("Impossible");
                break;
            }    
            else if(istart>iend)
            {
                count++;
                if(jend>=jstart)
                {
                    s=s+"UR ";
                    istart=istart-2;
                    jstart=jstart+1;
                }    
                else
                {
                    s=s+"UL ";
                    istart=istart-2;
                    jstart=jstart-1;
                }    
            }    
            else if(istart==iend&&jend>jstart)
            {
                count++;
                s=s+"R ";
                jstart=jstart+2;
                
            }    
            else if(istart<iend)
            {
                count++;
                if(jend>=jstart)
                {
                    s=s+"LR ";
                    istart=istart+2;
                    jstart=jstart+1;
                }    
                else
                {
                    s=s+"LL ";
                    istart=istart+2;
                    jstart=jstart-1;
                }    
            }  
            else if(istart==iend&&jend<jstart)
            {
                count++;
                    s=s+"L ";
                    jstart=jstart-2;
            }  
        }    
    }

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