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.
s = input()
t = input()
print(max(abs(ord(s[0]) - ord(t[0])), abs(int(s[1]) - int(t[1]))))
while s != t:
    if ord(s[0]) < ord(t[0]):
        print("R", end="")
        s = chr(ord(s[0]) + 1) + s[1]
    elif ord(s[0]) > ord(t[0]):
        print("L", end="")
        s = chr(ord(s[0]) - 1) + s[1]

    if int(s[1]) < int(t[1]):
        print("U", end="")
        s = s[0] + str(int(s[1]) + 1)
    elif int(s[1]) > int(t[1]):
        print("D", end="")
        s = s[0] + str(int(s[1]) - 1)

    print()
In Python, the code reads input using the input() function. The ord() function is used to get the ASCII value of a character, and chr() is used to convert an ASCII value back to a character. The int() function is used to convert the second character of the strings to integers for comparison. The print() function is used to display the output. The logic for calculating the minimum number of steps and outputting the sequence of moves remains the same as in the previous versions.





