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.
        if((i_start-i_end)%2!=0){
            System.out.print("Impossible");
            return;
        }
         ArrayList<String> list=new ArrayList<String>();   
        int ys=j_start;
        int yf=j_end;
        int xs=i_start;
        int xf=i_end;
        int count=0;
       while(true){
            if(xs>xf){
            if(ys<yf){
               list.add("UR ");
                count++;
                xs=xs-2;
                ys=ys+1;
            }
            else if(ys>=yf){
                    list.add("UL ");
                count++;
                    xs=xs-2;
                    ys=ys-1;
                }
                    
        }
        if(xs<xf){
            if(ys<=yf){
                list.add("LR ");
                count++;
                xs+=2;
                ys+=1;
            }
            else if(ys>yf){
                list.add("LL ");
                count++;
                xs+=2;
                ys=ys-1;
            }
           
            
        }
        if(xs==xf){
            if(ys<yf){
                while(ys<yf){
                    list.add("R ");
                    count++;
                    ys+=2;
                }
                if(ys!=yf){
                    System.out.print("Impossible");
                    return;
                }
                else
                    break;
                   
            }
            else if(ys>yf){
                while(ys>yf){
                    list.add("L ");
                    count++;
                    ys=ys-2;
                }
                if(ys!=yf){
                    System.out.print("Impossible");
                    return;
                }
                else
                    break;
            }
            else{break;}
        }
       }
        System.out.println(count);
        Iterator itr=list.iterator();
        while(itr.hasNext()){
            System.out.print(itr.next());
        }
    }

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