input: def fib_quad(n: int):
      """The fib_quad sequence is another sequence similar to the Fibonacci sequence, defined as follows:
      fib_quad(0) -> 0
      fib_quad(1) -> 0
      fib_quad(2) -> 2
      fib_quad(3) -> 0
      fib_quad(n) -> fib_quad(n-1) + fib_quad(n-2) + fib_quad(n-3) + fib_quad(n-4).
      Write a function to efficiently determine the n-th term of the fib_quad sequence. Avoid using recursion.
      >>> fib_quad(5)
      4
      >>> fib_quad(6)
      8
      >>> fib_quad(7)
      14
      """
output:     
      if n == 0:
          return 0
      elif n == 1:
          return 0
      elif n == 2:
          return 2
      elif n == 3:
          return 0
      
      # Initialize the first four terms
      terms = [0, 0, 2, 0]
      
      # Compute terms from 4 to n
      for i in range(4, n + 1):
          next_term = terms[-1] + terms[-2] + terms[-3] + terms[-4]
          terms.append(next_term)
      
      return terms[n]
  