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 is, int js, int ie, int je) {
         if(is%2==ie%2 && (js+Math.abs(ie-is)/2)%2==je%2)
         {
               int steps=Math.abs(ie-is)/2;
               if((js+steps>je && js<=je) || (js>=je && js-steps<je))
               {
                   System.out.println(steps);
               }
             else
             {
                 System.out.println(steps+Math.abs(js-je+steps*(je-js)/Math.abs(je-js))/2);
             }
             if(ie-is!=0 && je-js!=0){
               int jsteps=(je-js)/Math.abs(je-js);
               int isteps=2*(ie-is)/Math.abs(ie-is);
               char ver,hor;
               if(jsteps<0)
               {
                   hor='L';
               }else
               {
                   hor='R';
               }
              if(isteps<0)
              {
                  ver='U';
              }else
              {
                  ver='L';
              }
             
                 while((js-je)*(is-ie)!=0)
                 {
                     js+=jsteps;
                     is+=isteps;
                     System.out.print(ver+""+hor+" ");
                 }
             }  
             if(ie==is)
             {
                 int jsteps=2*(je-js)/Math.abs(je-js);
                 char hor; 
                 if(jsteps<0)
               {
                   hor='L';
               }else
               {
                   hor='R';
               }
                while(js!=je)
                {
                  js+=jsteps;
                    System.out.print(hor+" ");
                }
                 return;
             }
             else if(je==js)
             {
                 int isteps=2*(ie-is)/Math.abs(ie-is);
                 char ver;
                 boolean flag=false;
                 if(isteps<0)
                 {
                     ver='U';
                 }else
                 {
                     ver='L';
                 }
                 while(is!=ie)
                {
                  is+=isteps;
                     if(!flag){
                    System.out.print(ver+"R ");
                     flag=true;
                     }
                     else
                     {
                         System.out.print(ver+"L ");
                         flag=false;
                     }
                     
                }
                 return;
             }
             
         }
        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();
    }
}