The king is left alone on the chessboard. In spite of this loneliness, he doesn't lose heart, because he has business of national importance. For example, he has to pay an official visit to square *t*. As the king is not in habit of wasting his time, he wants to get from his current position *s* to square *t* in the least number of moves. Help him to do this.

In one move the king can get to the square that has a common side or a common vertex with the square the king is currently in (generally there are 8 different squares he can move to).
The first line contains the chessboard coordinates of square *s*, the second line — of square *t*.

Chessboard coordinates consist of two characters, the first one is a lowercase Latin letter (from a to h), the second one is a digit from 1 to 8.
#Exercise 3A - Stupid King Path
#We need to take 2 lines of input, which we store as a
#single string to work with
a=input()+input()
#Then we tell our program to process store the Unicode
#code point behind the letters in the variable b which 
#is meant to mimic the chess table and how many
#moves the king needs to make to get from one point to another.
#The input has the following format:
# letter_Number_letter_Number
a,b=(ord(a[i])-ord(a[i+2])for i in (0,1))
print(max(a,-a,b,-b))
#Now, we analyse the directions in which the king
#needs to move when geting from point a to point b
while a!=0 or b!=0:
  r=''
  if a<0:
      r='R';a+=1
  if a>0:r='L';a-=1
  if b<0:r+='U';b+=1
  if b>0:r+='D';b-=1
  #And we print out the moves he makes
  print(r)

