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.
        //         UL UR
        //        L  *  R
        //         LL LR
        int ii=i_start-i_end,iii=Math.abs(ii);int x=0;
        int jj=j_start-j_end,jjj=Math.abs(jj);String XXX="";
        if (iii%2==1) {System.out.println("Impossible");return;}
        int xx=iii/2%2;  // 0 3 4 3
        if((xx+jjj)%2==1){System.out.println("Impossible");return;}
        while(i_start!=i_end||j_start!=j_end){
        if(i_start<i_end&&j_start<=j_end)
        {XXX+="LR ";i_start+=2;j_start++;x++;}    
        if(i_start>i_end&&j_start>=j_end)
        {XXX+="UL ";i_start-=2;j_start--;x++;}    
        if(i_start>i_end&&j_start<j_end)
        {XXX+="UR ";i_start-=2;j_start++;x++;}    
        if(i_start<i_end&&j_start>j_end)
        {XXX+="LL ";i_start+=2;j_start--;x++;} 
        if(i_start==i_end&&j_start>j_end)
        {XXX+="L ";j_start-=2;x++;} 
        if(i_start==i_end&&j_start<j_end)
        {XXX+="R ";j_start+=2;x++;} 
            
        }
        System.out.println(x);
        System.out.println(XXX);
            return;
            
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int i_start = in.nextInt();//0
        int j_start = in.nextInt();//3
        int i_end = in.nextInt();  //4
        int j_end = in.nextInt();  //3
        printShortestPath(n, i_start, j_start, i_end, j_end);
        in.close();
    }
}