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 tempi,ul,l,r,tempj,i,moves;
        if(i_start>i_end && j_start>j_end)
        {
           tempi= i_start-i_end;
            tempj=j_start-j_end;
            
            ul=tempi/2;
            l=(tempj-ul)/2;
            moves=ul+l;
            System.out.println(moves);
            
            for(i=0;i<ul;i++)
            {
                System.out.print("UL ");
            }
            for(i=0;i<l;i++)
            {
                System.out.print("L ");
            }
            
            
        }
        if(i_start>i_end && j_start<j_end)
        {
           tempi= i_start-i_end;
            tempj=j_end-j_start;
            if(tempi%2==0)
            { ul=tempi/2;}
            else
            {System.out.println("Impossible");
            return ;
            }
            
            l=(tempj-ul)/2;
            moves=ul+l;
            System.out.println(moves);
            
            for(i=0;i<ul;i++)
            {
                System.out.print("UR ");
            }
            for(i=0;i<l;i++)
            {
                System.out.print("R ");
            }
            
            
        }
        if(i_start<i_end && j_start<=j_end)
        {
           tempi= i_end-i_start;
            tempj=j_end-j_start;
            if(tempi%2==0)
            { ul=tempi/2;}
            else
            {System.out.println("Impossible");
            return ;
            }
            if(tempj>ul)
            {l=(tempj-ul)/2;
            }
            else
                l=0;
            moves=ul+l;
            System.out.println(moves);
            
            for(i=0;i<ul/2;i++)
            {
                System.out.print("LR ");
                
            }
            for(i=0;i<ul/2;i++)
            {
                System.out.print("LL");
            }
            
            
        }
        
        
        
       
    }

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