input: Write a function to generate a Python program to calculate the Fibonacci number at a given position. Define the function recursively using the formula fibonacci(n) = fibonacci(n-1) + fibonacci(n-2) for n > 1, and return 1 for n = 1 and 0 for n = 0. Afterwards, print the Fibonacci number for n = 10.
  
  def fibonacci(n):
      if n == 0:
          return 0
      elif n == 1:
          return 1
      else:
          return fibonacci(n-1) + fibonacci(n-2)
  
  n = 10
  print(fibonacci(n))
  
  assert fibonacci(10)==55
  assert fibonacci(5)==5
  assert fibonacci(0)==0
  assert fibonacci(1)==1
  assert fibonacci(7)==13
output: def fibonacci(n):
      if n == 0:
          return 0
      elif n == 1:
          return 1
      else:
          return fibonacci(n-1) + fibonacci(n-2)