#822. Recursion: digit sum
You get n. Find the sum of its digits with a recursive function.
### Input
n (0 ≤ n ≤ 10¹⁸).
### Output
Answer.
Examples
Input
146708461312182614
Output
65
Input
846023653449833240
Output
74
💡 You can solve it with Python, JavaScript or blocks. Read the input line by line with input(). Don't print a question (like input("Number: ")). Print exactly what the output asks for, nothing more.