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 cur_row=i_start,cur_col=j_start,mov=0;
        //int[][] arr=new int[n][n];
        String[] st=new String[n];
        int k=-1;
        while(true)
        {
        	while((cur_row!=i_end)||(cur_col!=j_end))
            {
        		if((cur_row<0)||(cur_row>n)||(cur_col<0)||(cur_col>n))
                break;
                if(cur_row>i_end)
                {
                    cur_row=cur_row-2; 
                    if(cur_col>j_end)
                    {
                        cur_col=cur_col-1;
                        st[++k]="UL";
                        mov++;
                    }
                    else if(cur_col<j_end)
                    {
                        cur_col=cur_col+1;
                        st[++k]="UR";
                        mov++;
                    }
                    else
                    {
                        cur_col=cur_col+1;
                        st[++k]="UR";
                        if(cur_row<i_end)
                        break;
                        mov++;
                    }
                }
                else if(cur_row<i_end)
                {
                    cur_row=cur_row+2; 
                    if(cur_col>j_end)
                    {
                        cur_col=cur_col-1;
                        st[++k]="LL";
                        mov++;
                    }
                    else if(cur_col<j_end)
                    {
                        cur_col=cur_col+1;
                        st[++k]="LR";
                        mov++;
                    }
                    else
                    {
                        cur_col=cur_col+1;
                        st[++k]="LR";
                        if(cur_row>i_end)
                        break;
                        mov++;
                    }	
                }
                else
                {
                    if(cur_col>j_end)
                    {
                        st[++k]="L";
                        cur_col=cur_col-2;
                        if(cur_col<j_end)
                        break;
                        mov++;
                    }
                    else if(cur_col<j_end)
                    {
                        st[++k]="R";
                        cur_col=cur_col+2;
                        if(cur_col>j_end)
                        break;
                        mov++;
                    }
                    else 
                    break;
                }
                if((cur_row==i_end)&&(cur_col==j_end))
                break;
            }
            if((cur_row==i_end)&&(cur_col==j_end))
            {
            	break;    
            }
            else
            {
            	mov=-1;
                break;
            }
        }
        if(mov==-1)
        System.out.println("Impossible");
        else
        {
            System.out.println(mov);
            for(int p=0;p<=k;p++)
            System.out.print(st[p]+" ");
        }
    }

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