input: def compute_fib4_sequence(n: int):
      """The Fib4 sequence is similar to the Fibonacci sequence but follows these definitions:
      compute_fib4_sequence(0) -> 0
      compute_fib4_sequence(1) -> 0
      compute_fib4_sequence(2) -> 2
      compute_fib4_sequence(3) -> 0
      compute_fib4_sequence(n) -> compute_fib4_sequence(n-1) + compute_fib4_sequence(n-2) + compute_fib4_sequence(n-3) + compute_fib4_sequence(n-4).
      Write a function to determine the n-th term of the Fib4 sequence without using recursion.
      >>> compute_fib4_sequence(5)
      4
      >>> compute_fib4_sequence(6)
      8
      >>> compute_fib4_sequence(7)
      14
      """
output:     
      if n == 0:
          return 0
      elif n == 1:
          return 0
      elif n == 2:
          return 2
      elif n == 3:
          return 0
  
      fib4 = [0, 0, 2, 0]
      for i in range(4, n + 1):
          next_value = sum(fib4[-4:])
          fib4.append(next_value)
  
      return fib4[n]
  