# Your Problem:
# Given n of 1 or more, return the factorial of n, which is n * (n-1) * (n-2)
# ... 1. Compute the result recursively (without loops).
#
#
# factorial(1) → 1
# factorial(2) → 2
# factorial(3) → 6
#
# 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 getFactorial(n:int) -> int:
# CODE END
# Press Ctrl+E (Command+E on mac) to test your code