input: Write a python function to generate Fibonacci sequence up to a given number and return as a list.
  assert Fibonacci(10) == [0, 1, 1, 2, 3, 5, 8]
  assert Fibonacci(1) == [0]
  assert Fibonacci(15) == [0, 1, 1, 2, 3, 5, 8, 13]
output: def Fibonacci(n):
      if n <= 0:
          return []
      sequence = [0, 1]
      while True:
          next_value = sequence[-1] + sequence[-2]
          if next_value >= n:
              break
          sequence.append(next_value)
      return sequence if n > 1 else [0]