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 s=0;
        String sw ="";
        
        if((i_start-i_end)%2!=0)
        {
            System.out.println("Impossible");
            return;
        }
        
            if(j_start==j_end)
            {
                if((i_start-i_end)%2!=0)
                {
                   System.out.println("Impossible");
                }
                else
                {                    
                    int t = i_start-i_end;
                    t=t/4;
                    int p=t;
                    if(t<0)
                        t=t*-1;                     
                    if(p<0)
                    {
                       for(int i=0;i<t;i++)
                        sw = sw + "LR";
                       for(int i=0;i<t;i++)
                        sw = sw + "LL"; 
                    } 
                    else
                    {
                        for(int i=0;i<t;i++)
                        sw = sw + "UL";
                        for(int i=0;i<t;i++)
                        sw = sw + "UR";
                    }                   
                    s=t*2;                    
                    i_start=i_end;
                    j_start=j_end;
                }
            }
        while((i_start!=i_end) && (j_start!=j_end))
        {      
            if(i_start==i_end && j_start==j_end) 
                break;
           if(i_start>i_end && j_start>j_end)
            {
                i_start-=2;
                j_start-=1;
                s++;
                sw = sw + "UL";
            }
            if(i_start>i_end && j_start<j_end)
            {
                i_start-=2;
                j_start+=1;
                s++;
                sw = sw + "UR";
            }
            if(i_start==i_end)
            {                
                if(j_start>j_end)
                {
                    j_start-=2;
                    s++;
                    sw = sw + "L ";
                }
                if(j_start<j_end)
                {
                    j_start+=2;
                    s++;
                    sw = sw + "R ";
                }  
                
            }
            if(i_start<i_end && j_start<j_end)
            {
                i_start+=2;
                j_start+=1;
                s++;
                sw = sw + "LR";
            }
            if(i_start<i_end && j_start>j_end)
            {
                i_start+=2;
                j_start-=1;
                s++;
                sw = sw + "LL";
            }
            if(j_start==j_end && i_start!=i_end)
            {
                if((i_start-i_end)%2!=0)
                {
                   System.out.println("Impossible");
                    return;
                }
                else
                {                    
                    int t = i_start-i_end;
                    t=t/4;
                    int p=t;
                    if(t<0)
                        t*=-1;
                    if(p<0)
                    {
                       for(int i=0;i<t;i++)
                        sw = sw + "LR";
                       for(int i=0;i<t;i++)
                        sw = sw + "LL"; 
                    } 
                    else
                    {
                        for(int i=0;i<t;i++)
                        sw = sw + "UL";
                        for(int i=0;i<t;i++)
                        sw = sw + "UR";
                    }
                    s+=t*2;                    
                    i_start=i_end;
                    j_start=j_end;
                }
            }
            }
        
        System.out.println(s);
        for(int i=0;i<sw.length();i+=2)
        {
            if(sw.substring(i+1,i+2)!=" ")
             System.out.print(sw.substring(i,i+2)+" ");  
            else if(sw.substring(i+1,i+2)==" ")
                System.out.print(sw.substring(i,i+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();
    }
}