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.
        ArrayList<String> a=new ArrayList<String>();
        int flag=0,c=0;
        while(true)
        {
            if(i_start==i_end && j_start==j_end)
            {
                flag=1;
                break;
            }
            else if(Math.abs(i_start-i_end)<=1)
                break;
            
            else if(i_start==i_end)
                if(j_start>j_end)
                { j_start-=2;
                 a.add("L");
                c++;}
                 else
                 { j_start+=2;
                  a.add("R");
                  c++;
                 }
            
            else if(i_start>i_end)
                if(j_start>j_end)
                {
                    i_start-=2;
                    j_start-=1;
                    a.add("UL");
                    c++;
                }
                else
                {
                    i_start-=2;
                    j_start+=1;
                    a.add("UR");
                    c++;
                }
            
             else if(i_start<i_end)
                if(j_start>j_end)
                {
                    i_start+=2;
                    j_start-=1;
                    a.add("LL");
                    c++;
                }
                else
                {
                    i_start+=2;
                    j_start+=1;
                    a.add("LR");
                    c++;
                }
                    
        }
        if(flag==0)
            System.out.println("Impossible");
            else
            {
                System.out.println(c);
                for(int i=0;i<a.size();i++)
                    System.out.print(a.get(i)+" ");
            }
        
    }

    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();
    }
}