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[][] ar=new int[n][n];
        ar[i_end][j_end]=1;
         int i=i_start,j=j_start,count=0,f=0;
        String str="";
        int n1=(n-1)*(n-1);
          while(n1>0)
           { // if(i_start==j_end)
           //{
            // f=1;
            //   break;
               
           //}
         //   else{
              if((i-2<n&&j-1<n)&&(i-2>=0&&j-1>=0)&&(sh(i-2,j-1,i_end,j_end)<sh(i,j,i_end,j_end)))
                {  
                  if(ar[i-2][j-1]!=2)
                    {
                       if(ar[i-2][j-1]==1)    
                          { i=i-2;
                            j=j-1;
                           str=str+"UL"+" ";
                      count++;
                    break;}
                      else
                      {
                        i=i-2;
                        j=j-1;
                        str=str+"UL"+" ";
                        count++;
                        ar[i][j]=2;}
                       } 
                  else
                  {str="Impossible";
                  break;} 
              }
           else  if((i-2<n&&j+1<n)&&(i-2>=0&&j+1>=0)&&(sh(i-2,j+1,i_end,j_end)<sh(i,j,i_end,j_end)))
                {  
                  if(ar[i-2][j+1]!=2)
                   { 
                    if(ar[i-2][j+1]==1)    
                     {
                        i=i-2;j=j+1;str=str+"UR"+" ";
                      count++;
                    break;}
                    else
                      {
                      i=i-2;
                      j=j+1;
                      str=str+"UR"+" ";
                      count++;
                      ar[i][j]=2;}
                      } 
                  else
                 { str="Impossible";
                  break;  }
           }
               else if((i<n&&j+2<n)&&(i>=0&&j+2>=0)&&(sh(i,j+2,i_end,j_end)<sh(i,j,i_end,j_end)))
                {  
                  if(ar[i][j+2]!=2)
                   { 
                    if(ar[i][j+2]==1)    
                     {j=j+2;str=str+"R"+" ";
                      count++;
                    break;}
                    else
                      {
                      i=i;
                      j=j+2;
                      str=str+"R"+" ";
                      count++;
                      ar[i][j]=2;}
                      } 
                  else
                 { str="Impossible";
                  break;  }
           }
              else if((i+2<n&&j+1<n)&&(i+2>=0&&j+1>=0)&&(sh(i+2,j+1,i_end,j_end)<sh(i,j,i_end,j_end)))
                {  
                  if(ar[i+2][j+1]!=2)
                   { 
                    if(ar[i+2][j+1]==1)    
                    {i=i+2;j=j+1;str=str+"LR"+" ";
                      count++;
                    break;}
                    else
                      {
                      i=i+2;
                      j=j+1;
                      str=str+"LR"+" ";
                      count++;
                      ar[i][j]=2;}
                      } 
                  else
                 { str="Impossible";
                  break;  }
           }
               else if((i+2<n&&j-1<n)&&(i+2>=0&&j-1>=0)&&(sh(i+2,j-1,i_end,j_end)<sh(i,j,i_end,j_end)))
                {  
                  if(ar[i+2][j-1]!=2)
                    {
                       if(ar[i+2][j-1]==1)    
                        {i=i+2;j=j-1;str=str+"LL"+" ";
                      count++;
                    break;}
                      else
                      {
                        i=i+2;
                        j=j-1;
                        str=str+"LL"+" ";
                        count++;
                        ar[i][j]=2;}
                       } 
                  else
                  {str="Impossible";
                  break;} 
              }
             else   if((i<n&&j-2<n)&&(i>=0&&j-2>0)&&(sh(i,j-2,i_end,j_end)<sh(i,j,i_end,j_end)))
                {  
                  if(ar[i][j-2]!=2)
                   { 
                    if(ar[i][j-2]==1) 
                    {j=j-2;str=str+"L"+" ";
                      count++;
                    break;}
                    else
                      {
                      i=i;
                      j=j-2;
                      str=str+"L"+" ";
                      count++;
                      ar[i][j]=2;}
                      } 
                  else
                 { str="Impossible";
                  break;  }
           }
          n1--;
          }
          // }if(f==1)
          //  System.out.println("Impossible");
           // else{
           if (ar[i][j]==1)
           {
            System.out.println(count);
                   System.out.println(str);}
            else 
                   System.out.println("Impossible");
    }
  static double sh(int x1,int y1,int x2,int y2)
  {
      double s=Math.sqrt(((y2-y1)*(y2-y1))+((x2-x1)*(x2-x1)));
      return s;
  }
    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();
    }
}