For this Question: There is a robot starting at the position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0, 0) after it completes its moves.
You have given a string of moves that represents the move sequence of the robot where moves[i] represent its ith move. Valid moves are 'R' (right), 'L' (left), 'U' (up), and 'D' (down).
Return true if the robot returns to the origin after it finishes all of its moves, or false otherwise.
<b>Note:</b> 
The way that the robot is "facing" is irrelevant. 'R' will always make the robot move to the right once, 'L' will always make it move left, etc. Also, assume that the magnitude of the robot's movement is the same for each move.There is a single line containing a string as input.

<b>Constraints:</b>
1 &le; s. length &le; 10<sup>5</sup>
s contains only characters 'L', 'R', 'U', 'D'Print True if the robot returns to the origin after it finishes all of its moves, or False otherwise.Sample Input:
UD

Sample Output:
True, I have written this Solution Code: def main():
    moves = input()
    left = 0
    up = 0
    for c in moves:
        if(c == 'U'):
            up += 1
        if(c == 'D'):
            up -= 1
        if(c == 'L'):
            left += 1
        if(c == 'R'):
            left -= 1
    print(left == 0 and up == 0)

main(), In this Programming Language: Python, Now tell me if this Code is compilable or not?