input: Write a function to determine if it is possible to generate a given number (n) as a sum of two different Fibonacci numbers. If it is possible return True else return False.
  
  def sum_of_fibonacci_numbers(n):
      if n <= 0:
          return False
      fib_set = set()
      a, b = 0, 1
      while a <= n:
          fib_set.add(a)
          a, b = b, a + b
      for fib in fib_set:
          if (n - fib) in fib_set and (n - fib) != fib:
              return True
      return False
  
  assert sum_of_fibonacci_numbers(5) == True
  assert sum_of_fibonacci_numbers(10) == True
  assert sum_of_fibonacci_numbers(3) == True
  assert sum_of_fibonacci_numbers(1) == False
  assert sum_of_fibonacci_numbers(0) == False
output: def sum_of_fibonacci_numbers(n):
      if n <= 0:
          return False
      fib_set = set()
      a, b = 0, 1
      while a <= n:
          fib_set.add(a)
          a, b = b, a + b
      for fib in fib_set:
          if (n - fib) in fib_set and (n - fib) != fib:
              return True
      return False