Recursive Reverse

**Description:** Print the decimal digits of n reversed (leading zeros of the result disappear: 1200 -> 21). Solve it **recursively**: no while/for over the digits. **Input:** One line: n (0 <= n <= 10^15). **Output:** One integer — n with its digits reversed. **Example:** 1200 -> 21.