def printShortestPath(n, i_start, j_start, i_end, j_end)
    aa=[]
   x=["UL","UR","R","LR","LL","L"]
   # if(i_start>i_end&&j_start>j_end)
        
  #  elsif(i_start>i_end&&j_start<j_end)
            
   if(i_start>i_end&&j_start<j_end)
     k=true
   
         while k
         k=false
         
            if (i_start-2>=i_end&&i_start-2>=0)&&(j_start+1<=j_end&&j_start+1<=n-1)
                 i_start-=2
                 j_start+=1
                 aa<< "UR"
                 k=true
             elsif j_start+2<=j_end
                 j_start+=2
                 aa<< "R"
                 k=true
             end
             
        #if i_start>j_start||i_end<j_end
         #   return "impossible"
        #end
      end
      
      if j_start==j_end&&i_end==i_start
        print "#{aa.length}\n"
        
        for i in 0...x.length
          for j in 0...aa.length
          if x[i]==aa[j]
          print "#{aa[j]} "
        end
      end
        end
        
          
      else
        print "Impossible"
      end
      elsif(i_start>i_end&&j_start>j_end)
     k=true
   
         while k
         k=false
         
            if (i_start-2>=i_end&&i_start-2>=0)&&(j_start-1>=j_end&&j_start-1>=0)
                 i_start-=2
                 j_start-=1
                 aa<< "UL"
                 k=true
             elsif j_start-2>=j_end
                 j_start-=2
                 aa<< "L"
                 k=true
             end
             
        #if i_start>j_start||i_end<j_end
         #   return "impossible"
        #end
      end
      
      if j_start==j_end&&i_end==i_start
        print "#{aa.length}\n"
        for i in 0...x.length
          for j in 0...aa.length
          if x[i]==aa[j]
          print "#{aa[j]} "
        end
      end
        end
      else
        print "Impossible"
      end
      
      elsif(i_start<i_end&&j_start<j_end)
     k=true
   
         while k
         k=false
         
         
           if (i_start+2<=i_end&&i_start+2<=n-1)&&(j_start+1<=j_end&&j_start+1<=n-1)
                 i_start+=2
                 j_start+=1
                 aa<< "LR"
                 k=true
           elsif (i_start+2<=i_end&&i_start+2<=n-1)&&((j_start+1>j_end&&j_start+1<=n-1))
               i_start+=2
               j_start-=1
               aa << "LL"
               k=true
             elsif j_start+2<=j_end&&j_start+2<=n-1
                 j_start+=2
                 aa<< "R"
                 k=true
             end
             
        #if i_start>j_start||i_end<j_end
         #   return "impossible"
        #end
      end
      
      if j_start==j_end&&i_end==i_start
        print "#{aa.length}\n"
       
        for i in 0...x.length
          for j in 0...aa.length
          if x[i]==aa[j]
          print "#{aa[j]} "
        end
      end
        end
      else
        print "Impossible"
      end
      
      
      
      
      elsif(i_start<i_end&&j_start==j_end)
     k=true
   
         while k
         k=false
         
            if i_start+2<=i_end&&i_start+2<=n-1
                 i_start+=2
                 j_start+=1
                 aa<< "LR"
                 if i_start+2<=i_end
                    i_start+=2
                 j_start-=1
                 aa << "LL"
               end
                 k=true
             
             end
             
        #if i_start>j_start||i_end<j_end
         #   return "impossible"
        #end
      end
      
      if j_start==j_end&&i_end==i_start
        print "#{aa.length}\n"
         for i in 0...x.length
          for j in 0...aa.length
          if x[i]==aa[j]
          print "#{aa[j]} "
        end
      end
        end
      else
        print "Impossible"
      end
   
   
    elsif(i_start<i_end&&j_start>j_end)
     k=true
  
         while k
         k=false
         
            if (i_start+2<=i_end&&i_start+2<=n-1)&&(j_start-1>=j_end&&j_start-1>=0)
                 i_start+=2
                 j_start-=1
                 aa<< "LL"
                 k=true
                 elsif (i_start+2<=i_end&&i_start+2<=n-1)&&((j_start-1<j_end&&j_start+1<n-1))
               i_start+=2
               j_start+=1
               aa << "LR"
               k=true
             elsif j_start-2>=j_end&&j_start-2>=0
                 j_start-=2
                 aa<< "L"
                 k=true
             end
             
        #if i_start>j_start||i_end<j_end
         #   return "impossible"
        #end
      end
      
      if j_start==j_end&&i_end==i_start
        print "#{aa.length}\n"
        for i in 0...x.length
          for j in 0...aa.length
          if x[i]==aa[j]
          print "#{aa[j]} "
        end
      end
        end
      else
        print "Impossible"
      end
      
      elsif(i_start>i_end&&j_start==j_end)
     k=true
   
         while k
         k=false
         
            if i_start-2>=i_end&&i_start-2>=0
                 i_start-=2
                 j_start-=1
                 aa<< "UL"
                 if i_start-2>=i_end &&i_start-2>=0
                    i_start-=2
                 j_start+=1
                 aa << "UR"
               end
                 k=true
             
             end
             
        #if i_start>j_start||i_end<j_end
         #   return "impossible"
        #end
      end
      
      if j_start==j_end&&i_end==i_start
        print "#{aa.length}\n"
         for i in 0...x.length
          for j in 0...aa.length
          if x[i]==aa[j]
          print "#{aa[j]} "
        end
      end
        end
      else
        print "Impossible"
      end
      elsif(i_start==i_end&&j_start>j_end)
     k=true
   
         while k
         k=false
         
            
                 if j_start-2>=j_end&&j_start-2>=0
                    j_start-=2
                  k=true
                 aa << "L"
               end
                
             
             end
             
        #if i_start>j_start||i_end<j_end
         #   return "impossible"
        #end
      
      
      if j_start==j_end&&i_end==i_start
        print "#{aa.length}\n"
        for i in 0...x.length
          for j in 0...aa.length
          if x[i]==aa[j]
          print "#{aa[j]} "
        end
      end
        end
      else
        print "Impossible"
      end
      
      elsif(i_start==i_end&&j_start<j_end)
     k=true
    
   
         while k
         k=false
         
            
                 if j_start+2<=j_end&&j_start+2<=n-1
                    j_start+=2
                  k=true
                 aa << "R"
               end
                
             
             end
             
        #if i_start>j_start||i_end<j_end
         #   return "impossible"
        #end
      
      
      if j_start==j_end&&i_end==i_start
        print "#{aa.length}\n"
        for i in 0...x.length
          for j in 0...aa.length
          if x[i]==aa[j]
          print "#{aa[j]} "
        end
      end
        end
      else
        print "Impossible"
      end
    end
    
    #  Print the distance along with the sequence of moves.
end

n = gets.strip.to_i
i_start, j_start, i_end, j_end = gets.strip.split(' ')
i_start = i_start.to_i
j_start = j_start.to_i
i_end = i_end.to_i
j_end = j_end.to_i
printShortestPath(n, i_start, j_start, i_end, j_end)