# File:    moWeFib.py
# Author:  Dr. Gibson
# Date:    11/21/2016
# Section: N/A
# E-mail:  k.gibson@umbc.edu 
# Description:
#   This file contains python code that recursively implements
#   the Fibonacci sequence.

FIB_ONE = 0
FIB_TWO = 1

def fib(num):

    # BASE CASES: invalid choice, first number, second number
    if num <= 0:
        return "Invalid"
    elif num == 1:
        return FIB_ONE
    elif num == 2:
        return FIB_TWO

    # RECURSIVE CASE
    else:
        print("We are calculating number #", str(num))
        # RECURSIVE CALL(S)
        return fib(num-1) + fib(num-2)

 
def main():

    num = int(input("What number of the Fibonacci sequence do you want? "))
    ans = fib(num)
    print("The Fibonacci sequence's ", str(num) + "th number is:", ans)


main()