import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static boolean isValid(int a,int n)
    {
        if(a>=0 && a<n)
            return true;
        
        return false;
    }
    
    
    
    static void printShortestPath(int n, int j_start, int i_start, int j_end, int i_end) {
        //  Print the distance along with the sequence of moves.
        
        int count=0;
        ArrayList<String> str=new ArrayList<String>();
        
        while(i_start!=i_end || j_start!=j_end)
        {
            if(isValid(i_start-1,n) && isValid(j_start-2,n) && i_end<=i_start && j_end+1<j_start)
            {
                i_start=i_start-1;
                j_start=j_start-2;
                str.add("UL");
                count++;
            }
            
            else if(isValid(i_start+1,n) && isValid(j_start-2,n) && i_end>=i_start && j_end+1<j_start)
            {
                i_start=i_start+1;
                j_start=j_start-2;
                str.add("UR");
                count++;
            }
            
            else if(isValid(i_start+2,n) && isValid(j_start,n) && i_end-1>i_start && j_end==j_start)
            {
                i_start=i_start+2;
                str.add("R");
                count++;
            }
            
            else if(isValid(i_start+1,n) && isValid(j_start+2,n) && i_end>=i_start && j_end-1>j_start)
            {
                i_start=i_start+1;
                j_start=j_start+2;
                str.add("LR");
                count++;
            }
            
            else if(isValid(i_start-1,n) && isValid(j_start+2,n) && i_end<=i_start && j_end-1>j_start)
            {
                i_start=i_start-1;
                j_start=j_start+2;
                str.add("LL");
                count++;
            }
            
            else if(isValid(i_start-2,n) && isValid(j_start,n) && i_end+1<i_start && j_end==j_start)
            {
                i_start=i_start-2;
                str.add("L");
                count++;
            }
            
            else{ //System.out.print("gffd");
                break;
            }
            
            
            
        }
        
        
        if(i_start==i_end && j_start==j_end)
        {
            System.out.println(count);
            for(int i=0;i<str.size();i++)
            {
                System.out.print(str.get(i)+" ");
            }
        }
        
        else{
            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();
    }
}