import java.io.*;
import java.util.*;
import java.math.*;
public class codeforces
{
    static int n;
    static int i1;
    static int j1;
    static int i2;
    static int j2;
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        j1= sc.nextInt();
        i1= sc.nextInt();
        j2= sc.nextInt();
        i2= sc.nextInt();
        String arr []=new String[100];
        int counter=0;
        while(true)
        {
            if(counter==99)
            break;
            if((j2<j1&&i2<i1)||(i1==i2&&j2<j1))
            {
                arr[counter++]="UL";
                i1-=1;
                j1-=2;
            }
            else if(j2<j1&&i2>i1)
            {
                arr[counter++]="UR";
                i1+=1;
                j1-=2;
            }
            else if(j2==j1&&i2>i1)
            {
                arr[counter++]="R";
                i1+=2;
            }
            else if((j2>j1&&i2>i1)||(i1==i2&&j1<j2))
            {
                arr[counter++]="LR";
                i1+=1;
                j1+=2;
            }
            else if(j2>j1&&i1>i2)
            {
                arr[counter++]="LL";
                i1-=1;
                j1+=2;
            }
            else if(j2==j1&&i2<i1)
            {
                arr[counter++]="L";
                i1-=2;
            }
            else
                counter++;
            if(i1==i2&&j1==j2)
            break;
        }
        if(counter==99)
        System.out.println("Impossible");
        else
        {
            System.out.println(counter);
            for(int i = 0 ;i<counter;i++)
            {
                System.out.print(arr[i]+" ");
            }
        }
    }
}