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) {
        int j_track=j_start, i_track=i_start;
        int moves = 0;
        String answer ="";
        if(i_start == i_end){
            if(j_start < j_end){
                while(j_track < j_end){
                    moves += 1;
                    answer += "R ";
                    j_track += 2;
                }
                if(j_track==j_end){
                    System.out.println(moves);
                    System.out.println(answer);
                }
                else{
                    System.out.println("Impossible");
                }
            }
            else if(j_start > j_end){
                while(j_track > j_end){
                    moves += 1;
                    answer += "L ";
                    j_track -= 2;
                }
                if(j_track==j_end){
                    System.out.println(moves);
                    System.out.println(answer);
                }
                else{
                    System.out.println("Impossible");
                }
            }
            else{
                System.out.println(moves);
                System.out.println(answer);
            }
        }
        else{
            int movesH = 0;
            int movesV = 0;
            if(j_track < j_end){
                while(j_track < j_end){
                    movesH += 1;
                    j_track += 2;
                    //System.out.println(j_track);
                }
                if(j_track==j_end){
                    if(i_track < i_end){
                        while(i_track <i_end){
                            movesV += 1; 
                            i_track += 4;
                        }
                        if(i_track==i_end){
                            if(movesH > movesV){
                                for(int i=0; i<movesH-movesV; i++){
                                    answer +="R ";
                                    moves += 1;
                                }
                                for(int i=0; i<movesV; i++){
                                    answer +="LR LR ";
                                    moves += 1;
                                }
                            }
                            else{
                                if(movesV > movesH){
                                    for(int i=0; i<movesV-movesH; i++){
                                        answer +="LR LR ";
                                        moves += 2;
                                        i++;
                                    }
                                    for(int i=0; i<movesH; i++){
                                        answer +="LR LL ";
                                        moves += 2;
                                        i++;
                                    }
                                }
                                else{
                                    for(int i=0; i<movesH; i++){
                                        answer +="LR LR ";
                                        moves += 2;
                                        i++;
                                    }
                                }
                            }
                            System.out.println(moves);
                            System.out.println(answer);
                        }
                        else{
                            System.out.println("Impossible");
                        }
                    }
                    else{
                        while(i_track > i_end){
                            movesV += 1;
                            i_track -= 4;
                        }
                        if(i_track==i_end){
                            if(movesH > movesV){
                                for(int i=0; i<movesV; i++){
                                    answer +="UR UR ";
                                    moves += 2;
                                }
                                for(int i=0; i<movesH-movesV; i++){
                                    answer +="R ";
                                    moves += 1;
                                }
                            }
                            else{
                                if(movesV > movesH){
                                    for(int i=0; i<movesH; i++){
                                        answer +="UL UR ";
                                        moves += 2;
                                        i++;
                                    }
                                    for(int i=0; i<movesV-movesH; i++){
                                        answer +="UR UR ";
                                        moves += 2;
                                        i++;
                                    }
                                }
                                else{
                                    for(int i=0; i<movesH; i++){
                                        answer +="UR UR ";
                                        moves += 2;
                                        i++;
                                    }
                                }
                            }
                            
                           System.out.println(moves);
                            System.out.println(answer);
                        }
                        else{
                            System.out.println("Impossible");
                        }
                    }
                }
                else{
                    j_track -= 2;
                    movesH -= 1;
                    if(i_track < i_end){
                        while(i_track < i_end-4){
                            movesV += 1;
                            i_track += 4;
                        }
                        if(i_track+2 == i_end){
                            if(movesH > movesV){
                                for(int i=0; i<movesH-movesV; i++){
                                    answer +="R ";
                                    moves += 1;
                                }
                                answer +="LR ";
                            moves += 1;
                                for(int i=0; i<movesV; i++){
                                    answer +="LR LR ";
                                    moves += 2;
                                }
                            }
                            else{
                                if(movesV > movesH){
                                    for(int i=0; i<movesV-movesH; i++){
                                        answer +="LR LR ";
                                        moves += 2;
                                        i++;
                                    }
                                    answer +="LR ";
                            moves += 1;
                                    for(int i=0; i<movesH; i++){
                                        answer +="LR LL ";
                                        moves += 2;
                                        i++;
                                    }
                                }
                                else{
                                    for(int i=0; i<movesH; i++){
                                        answer +="LR LR ";
                                        moves += 2;
                                        i++;
                                    }
                                    answer +="LR ";
                            moves += 1;
                                }
                            }
                            
                            System.out.println(moves);
                            System.out.println(answer);
                        }
                        else{
                            System.out.println("Impossible");
                        }
                    }
                    else{
                        while(i_track > i_end-4){
                            movesV += 1;
                            i_track -= 4;
                        }
                        if(i_track-2==i_end){
                            if(movesH > movesV){
                                for(int i=0; i<movesV; i++){
                                    answer +="UR UR ";
                                    moves += 2;
                                }
                                answer +="UR ";
                            moves += 1;
                                for(int i=0; i<movesH-movesV; i++){
                                    answer +="R ";
                                    moves += 1;
                                }
                            }
                            else{
                                if(movesV > movesH){
                                    for(int i=0; i<movesH; i++){
                                        answer +="UL UR ";
                                        moves += 2;
                                        i++;
                                    }
                                    answer +="UR ";
                            moves += 1;
                                    for(int i=0; i<movesV-movesH; i++){
                                        answer +="UR UR ";
                                        moves += 2;
                                        i++;
                                    }
                                }
                                else{
                                    for(int i=0; i<movesH; i++){
                                        answer +="UR UR ";
                                        moves += 2;
                                        i++;
                                    }
                                    answer +="UR ";
                            moves += 1;
                                }
                            }
                            
                            
                            System.out.println(moves);
                            System.out.println(answer);
                        }
                        else{
                            System.out.println("Impossible");
                        }
                    }
                }
            }
            else if(j_track > j_end){
               while(j_track > j_end){
                    movesH += 1;
                    j_track -= 2;
                }
                //System.out.println(j_track);
                if(j_track==j_end){
                    if(i_track < i_end){
                        while(i_track <i_end){
                            movesV += 1; 
                            i_track += 4;
                        }
                        if(i_track==i_end){
                            if(movesH > movesV){
                                for(int i=0; i<movesV; i++){
                                    answer +="LL LL ";
                                    moves += 2;
                                }
                                for(int i=0; i<movesH-movesV; i++){
                                    answer +="L ";
                                    moves += 1;
                                }
                                
                            }
                            else{
                                if(movesV > movesH){
                                    for(int i=0; i<movesH; i++){
                                        answer +="LR LL ";
                                        moves += 2;
                                        i++;
                                    }
                                    for(int i=0; i<movesV-movesH; i++){
                                        answer +="LL LL ";
                                        moves += 2;
                                        i++;
                                    }
                                }
                                else{
                                    for(int i=0; i<movesH; i++){
                                        answer +="LL LL ";
                                        moves += 2;
                                        i++;
                                    }
                                }
                            }
                            System.out.println(moves);
                            System.out.println(answer);
                        }
                        else{
                            System.out.println("Impossible");
                        }
                    }
                    else{
                        while(i_track > i_end){
                            movesV += 1;
                            i_track -= 4;
                        }
                        if(i_track==i_end){
                            if(movesH > movesV){
                                for(int i=0; i<movesV; i++){
                                    answer +="UL UL ";
                                    moves += 2;
                                }
                                for(int i=0; i<movesH-movesV; i++){
                                    answer +="L ";
                                    moves += 1;
                                }
                            }
                            else{
                                if(movesV > movesH){
                                    for(int i=0; i<movesV-movesH; i++){
                                        answer +="UL UL ";
                                        moves += 2;
                                        i++;
                                    }
                                    for(int i=0; i<movesH; i++){
                                        answer +="UL UR ";
                                        moves += 2;
                                        i++;
                                    }
                                    
                                }
                                else{
                                    for(int i=0; i<movesH; i++){
                                        answer +="UL UL ";
                                        moves += 2;
                                        i++;
                                    }
                                }
                            }
                            
                           System.out.println(moves);
                            System.out.println(answer);
                        }
                        else{
                            System.out.println("Impossible");
                        }
                    }
                }
                else{
                    j_track += 2;
                    movesH -= 1;
                    if(i_track < i_end){
                        while(i_track < i_end-4){
                            movesV += 1;
                            i_track += 4;
                        }
                        if(i_track+2 == i_end){
                            if(movesH > movesV){
                                for(int i=0; i<movesV; i++){
                                    answer +="LL LL ";
                                    moves += 2;
                                }
                                answer +="LL ";
                            moves += 1;
                                for(int i=0; i<movesH-movesV; i++){
                                    answer +="L ";
                                    moves += 1;
                                }
                                
                            }
                            else{
                                if(movesV > movesH){
                                    for(int i=0; i<movesH; i++){
                                        answer +="LR LL ";
                                        moves += 2;
                                        i++;
                                    }
                                    answer +="LL ";
                            moves += 1;
                                    for(int i=0; i<movesV-movesH; i++){
                                        answer +="LL LL ";
                                        moves += 2;
                                        i++;
                                    }
                                }
                                else{
                                    for(int i=0; i<movesH; i++){
                                        answer +="LL LL ";
                                        moves += 2;
                                        i++;
                                    }
                                    answer +="LL ";
                            moves += 1;
                                }
                            }
                            System.out.println(moves);
                            System.out.println(answer);
                        }
                        else{
                            System.out.println("Impossible");
                        }
                    }
                    else{
                        while(i_track > i_end+4){
                            movesV += 1;
                            i_track -= 4;
                        }
                        //System.out.println(i_track);
                        if(i_track-2==i_end){
                            if(movesH > movesV){
                                for(int i=0; i<movesV; i++){
                                    answer +="UL UL ";
                                    moves += 2;
                                }
                                answer +="UL ";
                                moves += 1;
                                for(int i=0; i<movesH-movesV; i++){
                                    answer +="L ";
                                    moves += 1;
                                }
                            }
                            else{
                                if(movesV > movesH){
                                    for(int i=0; i<movesV-movesH; i++){
                                        answer +="UL UL ";
                                        moves += 2;
                                        i++;
                                    }
                                    answer +="UL";
                                    moves += 1;
                                    for(int i=0; i<movesH; i++){
                                        answer +="UL UR ";
                                        moves += 2;
                                        i++;
                                    }
                                    
                                }
                                else{
                                    for(int i=0; i<movesH; i++){
                                        answer +="UL UL ";
                                        moves += 2;
                                        i++;
                                    }
                                    answer +="UL";
                                    moves += 1;
                                }
                            }
                            
                           System.out.println(moves);
                           System.out.println(answer);
                        }
                        else{
                            System.out.println("Impossible");
                        }
                    }
                }
            }
            else{
                if(i_track < i_end){
                    while(i_track <i_end) {
                        moves += 2;
                        answer += "LR LL";
                        i_track += 4;
                    }
                    if(i_track == i_end) {
                        System.out.println(moves);
                        System.out.println(answer);
                    }
                    else System.out.println("Impossible");
                }
                else{
                    while(i_track > i_end) {
                        moves += 2;
                        answer += "UL UR";
                        i_track -= 4;
                    }
                    if(i_track == i_end) {
                        System.out.println(moves);
                        System.out.println(answer);
                    }
                    else System.out.println("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();
    }
}