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