Bob and Khatu are stuck in matrix. The command center sent them a string which decodes to the their final destination. Since Bob and Khatu are not good at problem solving help them to figure out their final destination. They are initially at (0, 0). String contains L, R, U, D denoting left, right, up and down. In each command they will traverse 1 unit distance in the respective direction. For example if they are at (2, 0) and the command is they will go to (1, 0).
Input:
Input contains a single string.
Output:
Print the final destination location of Bob and Khatu.
Constraints:
1 ≤ |S| ≤ 105
Initail Postion : 0, 0
1.) 'L' -> cover one unit of distance in left direction. New position (-1,0)
2.) 'L' -> new position (-2,0)
3.) 'R' -> new position (-1,0)
4.) 'D' -> new position (-1,-1)
5.) 'D' -> new position (-1,-2)
6.) 'R' -> new position (0,-2)
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Login to unlock the editorial
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor