input: Write a function to calculate the Fibonacci numbers up to a given number n. The function should return the nth Fibonacci number. If n is 0, the function should return 0. If n is 1, the function should return 1. For any other value of n, the function should return the sum of the (n-1)th and (n-2)th Fibonacci numbers.
  
  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
output: def Fibonacci(n): 
  	if n==0: 
  		return 0
  	if n==1: 
  		return 1
  	else: 
  		return Fibonacci(n-1)+Fibonacci(n-2)