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 i1, int j1, int i2, int j2) 
    {
        int c=0;
        String s="";
        if(i1%2!=i2%2)
            System.out.println("Impossible");
        else if((j1%2==j2%2)&&((Math.abs(i1-i2))/2)%2==1)
            System.out.println("Impossible");
        else
        {
            while(i1!=i2||j1!=j2)
            {
                if(j2<j1)
                {
                    if(i2<i1)
                    {
                        i1-=2;
                        j1--;
                        s+="UL ";
                        c++;
                    }
                    else if(i2>i1)
                    {
                        i1+=2;
                        j1--;
                        s+="LL ";
                        c++;
                    }
                    else
                    {
                        j1-=2;
                        s+="L ";
                        c++;
                    }
                }
                else if(j2>j1)
                {
                    if(i2<i1)
                    {
                        i1-=2;
                        j1++;
                        s+="UR ";
                        c++;
                    }
                    else if(i2==i1)
                    {
                        j1+=2;
                        s+="R ";
                        c++;
                    }
                    else
                    {
                        i1+=2;
                        j1++;
                        s+="LR ";
                        c++;
                    }
                }
                else
                {
                    if(i2<i1)
                    {
                        i1-=2;
                        j1--;
                        s+="UL ";
                        c++;
                    }
                    else
                    {
                        i1+=2;
                        j1++;
                        s+="LR ";
                        c++;
                    }
                }
            }
            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();
    }
}