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) {
        boolean cb=true;
        String s="";
        int cnt=0;
        while(i_start!=i_end || j_start!=j_end)
        {
            cnt++;
            if(i_start-2>=i_end && j_start-1>=j_end )
            {
                s+="UL ";
                i_start-=2;
                j_start-=1;
            }
            else if(i_start-2>=i_end && j_start+1<=j_end)
            {
                s+="UR ";
                i_start-=2;
                j_start+=1;
            }
            else if(j_start+2<=j_end)
            {
                s+="R ";
                j_start+=2;
            }
            else if(i_start+2<=i_end && j_start+1<=j_end)
            {
                s+="LR ";
                i_start+=2;
                j_start+=1;
            }
            else if(i_start+2<=i_end && j_start-1>=j_end)
            {
                s+="LL ";
                i_start+=2;
                j_start-=1;
            }
            else if(j_start-2>=j_end)
            {
                s+="L ";
                j_start-=2;
            }
            else
            {
                System.out.println("Impossible");
                cb=false;
                break;
            }
            
        }
          if(cb)
              System.out.println(cnt+"\n"+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();
    }
}