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

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