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.
        boolean flag=true;
        int y1 = i_start;
        int x1 = j_start;
        int y2 = i_end;
        int x2 = j_end;
        String move = "";
        int moves = 0;
        while(flag){
            flag = false;
            if(x1==x2 && y1==y2){
                break;
            }
            if(y2<=y1-2 && (x2<=x1-1 || x1==x2)){
                flag=true;
                y1 = y1-2;
                x1 = x1-1;
                moves++;
                move=move+"UL ";
            }else if(y2<=y1-2 && x2>=x1+1){
                flag = true;
                y1=y1-2;
                x1=x1+1;
                moves++;
                move=move+"UR ";
            }else if(x2>=x1+2){
                flag=true;
                x1=x1+2;
                moves++;
                move=move+"R ";
            }else if(y2>=y1+2 && (x2>=x1+1|| x1==x2)){
                flag=true;
                y1=y1+2;
                x1=x1+1;
                moves++;
                move=move+"LR ";
            }else if(y2>=y1+2 && x2<=x1-1){
                flag=true;
                y1=y1+2;
                x1=x1-1;
                moves++;
                move=move+"LL ";
            }else if(x2<=x1-2){
                flag=true;
                x1=x1-2;
                moves++;
                move=move+"L ";
            }
        }
        if(x1==x2 && y1==y2){
            System.out.println(moves);
            System.out.print(move.substring(0,move.length()-1));
        }else{
            System.out.print("Impossible");
        }
        
    }

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