Martian robot P91245

0.61 A robot has been sent to the surface of Mars, which for simplicity we consider as an infinite two-dimensional grid. The robot is initially at the $(0, 0)$ cell. We will transmit a sequence of instructions to the robot, each one being ‘L’, ‘R’, ‘U’ or ‘D’ (for left, right, up or down, respectively). For each instruction received by the robot, it will move one step in that direction. For instance, if the robot receives an ‘R’ as its first instruction, it will move to $(1, 0)$.

0.39

Since communication with Mars is still complicated, some (or none, or all) of the instructions may be lost. In any case, the relative order of the instructions received by the robot will be preserved. Can you compute the total number of possible final positions of the robot?

For example, suppose that the sequence of instructions is “DRUD”. If the first and the last instructions are lost, then the robot will end at $(1, 1)$ after one move to the right and one upwards. If no instruction is lost, the robot will end at $(1, -1)$, etc.

Input

Input consists of several cases, each one with a string of size between 1 and $10^4$, made up of only letters chosen among ‘L’, ‘R’, ‘U’ and ‘D’.

Output

For every case, print the total number of different positions where the robot may end.