input: Write a function to calculate the Fibonacci numbers up to a given number. The function should return a list containing the Fibonacci sequence up to the given number. If the given number is less than 0, return an empty list.
  def Fibonacci(n):
      if n < 0:
          return []
      if n == 0:
          return [0]
      if n == 1:
          return [0, 1]
      fib_sequence = [0, 1]
      while fib_sequence[-1] <= n:
          fib_sequence.append(fib_sequence[-1] + fib_sequence[-2])
      return fib_sequence[:-1]
  
  assert Fibonacci(10) == [0, 1, 1, 2, 3, 5, 8]
  assert Fibonacci(1) == [0, 1]
  assert Fibonacci(0) == [0]
  assert Fibonacci(-1) == []
  assert Fibonacci(21) == [0, 1, 1, 2, 3, 5, 8, 13, 21]
output: def Fibonacci(n):
      if n < 0:
          return []
      if n == 0:
          return [0]
      if n == 1:
          return [0, 1]
      fib_sequence = [0, 1]
      while fib_sequence[-1] <= n:
          fib_sequence.append(fib_sequence[-1] + fib_sequence[-2])
      return fib_sequence[:-1]