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.
    	
    	String s="";
    	int c=0;
		if(i_start<i_end && j_start<j_end)
		{
			if((i_end-i_start)%2 == 0 && (j_end-(i_end-i_start)/2)%2 == j_start)
			{
				//s="Possible";
				for(int i=1;i<=(j_end-(i_end-i_start)/2)/2;i++)
					{s+="R ";c++;}
				for(int i=1;i<=(i_end-i_start)/2;i++)
					{s+="LR ";c++;}
				//break;
			}
			else
				s="Impossible";
				
			
		}    		
		else if(i_start>i_end && j_start<j_end)
		{
			if((i_start-i_end)%2 == 0 && (j_end-(i_start-i_end)/2)%2 == j_start)
			{
				//s="Possible";
				for(int i=1;i<=(i_start-i_end)/2;i++)
					{s+="UR ";c++;}
				for(int i=1;i<=(j_end-(i_start-i_end)/2)/2;i++)
					{s+="R ";c++;}
				
			}
			else
				s="Impossible";
			
		}
		else if(i_start<i_end && j_start>j_end)
		{
			if((i_end-i_start)%2 == 0 && (j_start-(i_end-i_start)/2)%2 == j_end)
			{	
				//s="Possible";
				for(int i=1;i<=(i_end-i_start)/2;i++)
					{s+="LL ";c++;}
				for(int i=1;i<=(j_start-(i_end-i_start)/2)/2;i++)
					{s+="L ";c++;}
				
			}
			else
				s="Impossible";
				
		}
		else if(i_start>i_end && j_start>j_end)
		{
			if((i_start-i_end)%2 == 0 && (j_start-(i_start-i_end)/2)%2 == j_end)
			{	
				//s="Possible";
				for(int i=1;i<=(i_start-i_end)/2;i++)
					{s+="UL ";c++;}
				for(int i=1;i<=(j_start-(i_start-i_end)/2)/2;i++)
					{s+="L ";c++;}
				
			}
			else
				s="Impossible";
		}
		else if(i_start==i_end)
		{
			if(j_start>j_end && (j_start-j_end)%2==0)
				for(int i=1;i<=(j_start-j_end)/2;i++)
					{s+="L ";c++;}
			else if(j_start<=j_end && (j_start-j_end)%2==0)
				for(int i=1;i<=(j_end-j_start)/2;i++)
					{s+="R ";c++;}
			else
				s="Impossible";
				
			
		}
		else if(j_start==j_end)
		{
			if(i_start>i_end && (i_start-i_end)%4==0)
			{
				for(int i=1;i<=(i_start-i_end)/4;i++)
					{s+="UL ";c++;}
				for(int i=1;i<=(i_start-i_end)/4;i++)
					{s+="UR ";c++;}
			}
			else if(i_start<i_end && (i_end-i_start)%4==0)
			{
				for(int i=1;i<=(i_end-i_start)/4;i++)
					{s+="LR ";c++;}
				for(int i=1;i<=(i_end-i_start)/4;i++)
					{s+="LL ";c++;}
			}	
			else
				s="Impossible";
		}
		else
			s="Impossible";
        if(!s.equals("Impossible"))
		  System.out.println(c);
    	System.out.println(s);
    	
    }
    
    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();
    }
}