# Your Problem:
# Given a non-negative int n, return the sum of its digits recursively (no
# loops). Note that mod (%) by 10 yields the rightmost digit (126 % 10 is 6),
# while divide (/) by 10 removes the rightmost digit (126 / 10 is 12).
#
#
# sumDigits(126) → 9
# sumDigits(49) → 13
# sumDigits(12) → 3
#
# Credit for this problem goes to Nick Parlante from CodingBat.com
# Do not modify anything outside of the function or the function itself.
# CODE START
def getSumDigits(num:int) -> int:
# CODE END
# Press Ctrl+E (Command+E on mac) to test your code