Problem Description

Input has one integer n is provided (non-negative). Write recursive function sumdig(n). Output result.

Input Format

One integer n.

Output Format

One integer sum of digits.

Sample Test Case

Input:
9991
Output:
28

Constraints

0

Solutions (0)

No solutions submitted yet. Be the first!

Discussion (0)

No comments yet. Start the discussion!

Prev Next