import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static int updatedI;
    static int updatedJ;
    static int numberOfMoves;
    static ArrayList <String> orderOfMoves = new ArrayList <String>();
    static boolean impossible = false;

    static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
        updatedI = i_start;
        updatedJ = j_start; 
        numberOfMoves = 0;
        
        while(updatedI!=i_end || updatedJ!=j_end){
            if(i_end>updatedI && (i_end-updatedI)%2==0 && j_end>updatedJ){
                moveLowerRight(updatedI, updatedJ);
            }
            else if(i_end>updatedI && (i_end-updatedI)%2==0 && j_end<updatedJ){
                moveLowerLeft(updatedI, updatedJ);
            }
            else if(i_end<updatedI && (i_end-updatedI)%2==0 && j_end>updatedJ){
                moveUpperRight(updatedI, updatedJ);
            }
            else if(i_end<updatedI && (i_end-updatedI)%2==0 && j_end<updatedJ){
                moveUpperLeft(updatedI, updatedJ);
            }
            else if(i_end==updatedI && j_end>updatedJ){
                moveRight(updatedJ);
            }
            else if(i_end==updatedI && j_end<updatedJ){
                moveLeft(updatedJ);
            }
            else if(i_end>updatedI && Math.abs(i_end-updatedI)%2==0 && updatedJ<n){
                moveLowerRight(updatedI, updatedJ);
            }
            else if(i_end>updatedI && Math.abs(i_end-updatedI)%2==0 && updatedJ==n){
                moveLowerLeft(updatedI, updatedJ);
            }
            else if(i_end<updatedI && Math.abs(i_end-updatedI)%2==0 && updatedJ<n){
                moveUpperRight(updatedI, updatedJ);
            }
            else if(i_end<updatedI && Math.abs(i_end-updatedI)%2==0 && updatedJ==n){
                moveUpperLeft(updatedI, updatedJ);
            }
            else{
                impossible = true;
                break;
            }
        }
        if(impossible == false){
            System.out.println(numberOfMoves);
            for(int k = 0; k < orderOfMoves.size(); k++){
                System.out.print(orderOfMoves.get(k) + " ");
            }
        }
        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();
    }
    
    static void moveUpperRight(int i, int j){
        updatedI = i - 2;
        updatedJ = j + 1;
        numberOfMoves++;
        orderOfMoves.add("UR");
    }
    
    static void moveUpperLeft(int i, int j){
        updatedI = i - 2;
        updatedJ = j - 1;
        numberOfMoves++;
        orderOfMoves.add("UL");
    }
    
    static void moveLowerRight(int i, int j){
        updatedI = i + 2;
        updatedJ = j + 1;
        numberOfMoves++;
        orderOfMoves.add("LR");
    }
    
    static void moveLowerLeft(int i, int j){
        updatedI = i + 2;
        updatedJ = j - 1;
        numberOfMoves++;
        orderOfMoves.add("LL");
    }
    
    static void moveRight(int j){
        updatedJ = j + 2;
        numberOfMoves++;
        orderOfMoves.add("R");
    }
    
    static void moveLeft(int j){
        updatedJ = j - 2;
        numberOfMoves++;
        orderOfMoves.add("L");
    }
}