Given a whole number, print it’s recursive sum.
UnsolvedGiven n, take the sum of the digits of n. If that value has more than one digit, continue reducing in this way until a single-digit number is produced.
value1
A whole number.
Sample Input 1
value1: 1919 output: 2