#Jonathan Hudson
#Student Number 12347890
#Date: 2020-08-26
#Lecture Practice

# Compute numbers in the Fibonacci sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, ...

# Compute the nth Fibonacci number using recursion
# Parameters:
#   n: The Fibonacci number to computer
# Returns: The nth Fibonacci number
def fib(n):
  # Base cases
  if n == 0:
    return 0
  if n == 1:
    return 1

  # Recursive case
  return fib(n-1) + fib(n-2)

# Compute a Fibonacci value requested by the user
n = int(input("Enter an integer: "))
print("fib(",n,") is", fib(n))