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_diff=i_start-i_end;
        int j_diff=j_start-j_end;
        int i_dist=Math.abs(i_diff);
        int j_dist=Math.abs(j_diff);
        int steps=0;
        String move_i="";
        String move_j="";
        String move="";
        if(i_dist%2!=0){
            System.out.println("Impossible"); 
        }
        else{
            steps=i_dist/2;
            int remain_dist_j=j_dist-steps;
            if(remain_dist_j%2!=0){
                System.out.println("Impossible");
            }
            else{
                if(i_diff>0){
                    for(int j=0;j<steps;j++){
                        move_i+="U,";     
                    }
                }
                else if(i_diff<0){
                    for(int j=0;j<steps;j++){
                        move_i+="L,";     
                    }
                }
                if(j_diff>0){
                    for(int j=0;j<steps;j++){
                        move_j+="L,";     
                    }
                }
                else if(j_diff<0){
                    for(int j=0;j<steps;j++){
                        move_j+="R,";     
                    }
                }
                else{
                    for(int j=0;j<steps/2;j++){
                        move_j+="R,";     
                    }
                    for(int j=0;j<steps/2;j++){
                        move_j+="L,";     
                    }
                }
                //System.out.println(move_i);
                //System.out.println(move_j);
                move_i= move_i.substring(0, move_i.length() - 1);
                move_j= move_j.substring(0, move_j.length() - 1);
                move=mergeMove(move_i,move_j);
                if(remain_dist_j>0){
                    steps+=remain_dist_j/2;
                }                
                if(j_diff>0){
                    for(int j=0;j<remain_dist_j/2;j++){
                        move+=" L";
                    }
                }
                else if(j_diff<0){
                    for(int j=0;j<remain_dist_j/2;j++){
                        move+=" R";
                    }
                }
                System.out.println(steps);
                System.out.println(move);
            }
        }
    }
    public static String mergeMove(String arr1,String arr2){
        String[] move_i=arr1.split(",");
        String[] move_j=arr2.split(",");
        String move="";
        for(int i=0;i<move_i.length;i++){
            move+=move_i[i]+move_j[i]+" ";
        }
        move=move.substring(0,move.length()-1);
        return move;
    }
    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();
    }
}