input: def fib_quadruple(n: int):
      """The Quadruple Fibonacci sequence is a variant of the Fibonacci sequence defined as:
      fib_quadruple(0) -> 0
      fib_quadruple(1) -> 0
      fib_quadruple(2) -> 2
      fib_quadruple(3) -> 0
      fib_quadruple(n) -> fib_quadruple(n-1) + fib_quadruple(n-2) + fib_quadruple(n-3) + fib_quadruple(n-4).
      Please provide a function to calculate the n-th term of this sequence efficiently without using recursion.
      >>> fib_quadruple(5)
      4
      >>> fib_quadruple(6)
      8
      >>> fib_quadruple(7)
      14
      """
output:     
      if n == 0:
          return 0
      elif n == 1:
          return 0
      elif n == 2:
          return 2
      elif n == 3:
          return 0
  
      fib_quad = [0, 0, 2, 0]
      
      for i in range(4, n+1):
          next_term = fib_quad[-1] + fib_quad[-2] + fib_quad[-3] + fib_quad[-4]
          fib_quad.append(next_term)
      
      return fib_quad[n]
  