input: Write a function to generate Fibonacci numbers up to a given number. If the input number is 0, return 0. If the input number is 1, return 1. For any other number, return the sum of the two preceding numbers in the Fibonacci sequence.
  
  def Fibonacci(n): 
      if n==0: 
          return 0
      if n==1: 
          return 1
      else: 
          return Fibonacci(n-1) + Fibonacci(n-2)
  
  assert Fibonacci(0) == 0
  assert Fibonacci(1) == 1
  assert Fibonacci(2) == 1
  assert Fibonacci(3) == 2
  assert Fibonacci(4) == 3
  assert Fibonacci(5) == 5
  assert Fibonacci(6) == 8
output: def Fibonacci(n): 
      if n==0: 
          return 0
      if n==1: 
          return 1
      else: 
          return Fibonacci(n-1) + Fibonacci(n-2)