using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
class Solution {

    static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
        int ci=i_start, cj=j_start, move=0;
        string result = "";
        
        while(true){
                if(ci>n || cj>n || ci<0 || cj<0){
                    Console.Write("Impossible");
                    break;
                }
            
                if(ci==i_end && cj==j_end){
                    Console.WriteLine(move);
                    Console.Write(result.Substring(0,result.Length-1));
                    break;
                }
            
                if(i_end<ci && j_end<=cj){
                    ci=ci-2; cj=cj-1;
                    result+="UL ";  
                }
                else if(i_end<ci && j_end>=cj){
                    ci=ci-2; cj=cj+1;
                    result+="UR ";  
                }
                else if(i_end==ci && j_end>cj){
                    cj=cj+2;
                    result+="R ";  
                }
                else if(i_end>ci && j_end>=cj){
                    ci=ci+2; cj=cj+1;
                    result+="LR ";  
                }
                else if(i_end>ci && j_end<=cj){
                    ci=ci+2; cj=cj-1;
                    result+="LL ";  
                }
                else if(i_end==ci && j_end<cj){
                    cj=cj-2;
                    result+="L ";  
                }
            
                move++;
            }
    }

    static void Main(String[] args) {
        int n = Convert.ToInt32(Console.ReadLine());
        string[] tokens_i_start = Console.ReadLine().Split(' ');
        int i_start = Convert.ToInt32(tokens_i_start[0]);
        int j_start = Convert.ToInt32(tokens_i_start[1]);
        int i_end = Convert.ToInt32(tokens_i_start[2]);
        int j_end = Convert.ToInt32(tokens_i_start[3]);
        printShortestPath(n, i_start, j_start, i_end, j_end);
    }
}