import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    static int a[]={-2,-2,0,2,2,0};
    static int b[]={-1,1,2,1,-1,-2};
    static int n;
    static int x1,x2,y1,y2;
    static String ans;
    static int visited[][]=new int [201][201];
    static String choose[]={"UL", "UR", "R", "LR", "LL", "L"};
    static int min=9999999;
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        n=in.nextInt();
        x1=in.nextInt();
        y1=in.nextInt();
        x2=in.nextInt();
        y2=in.nextInt();
        for(int i=0;i<=200;i++)
            for(int j=0;j<=200;j++)
                visited[i][j]=0;
        String s="";
        find(x1,y1,0,s);
        if(ans==null)
        System.out.println("Impossible");
        else
        {
        System.out.println(min);
        System.out.println(ans);
        }
    }
    public static void find(int start,int end,int marks,String s)
    {
        if(start<0 || start>=n || end<0 || end>=n)
            return ;
        if(start==x2 && end==y2)
        {
            if(min>marks)
            {
                min=marks;
                ans=s;
            }
            return ;
        }
        else
        {
            visited[start][end]=1;
            for(int i=0;i<6;i++)
            {
                if(start+a[i]>=0 && start+a[i]<n && end+b[i]>=0 && end+b[i]<n && visited[start+a[i]][end+b[i]]==0)
                {
                    find(start+a[i],end+b[i],marks+1,s+choose[i]+" ");
                    visited[start+a[i]][end+b[i]]=0;
                }
            }
        }
    }
}