





'''simple docstring'''




def 	_lowerCAmelCase      (  __snake_case  :			int = 4_00_00_00      )					->					int:
     __A						:			Optional[Any]								=	[0, 1]
     __A						:			List[str]								=	0
     while fib[i] <= n:
          fib.append(fib[i] + fib[i + 1]      )
          if fib[i + 2] > n:
               break
          i += 1
     __A						:			Optional[Any]								=	0
     for j in range(len(__snake_case      ) - 1      ):
          if fib[j] % 2 == 0:
               total += fib[j]

     return total


if __name__ == "__main__":
  print(f"""{solution() = }""")






'''simple docstring'''




from __future__ import annotations






def 	_lowerCAmelCase      (  __snake_case  :			list[int | str]      )					->					None:
     create_state_space_tree(__snake_case			,							[]			,							0			,							[0 for i in range(len(__snake_case      )      )]      )






def 	_lowerCAmelCase      (  __snake_case  :			list[int | str]			,							__snake_case  :			list[int | str]			,							__snake_case  :			int			,							__snake_case  :			list[int]			,							)					->					None:

     if index == len(__snake_case      ):
          print(__snake_case      )
          return

     for i in range(len(__snake_case      )      ):
          if not index_used[i]:
               current_sequence.append(sequence[i]      )
               __A						:			Any								=	True
               create_state_space_tree(__snake_case			,							__snake_case			,							index + 1			,							__snake_case      )
               current_sequence.pop()
               __A						:			Any								=	False
lowercase__   :				list[int | str]      =   [3, 1, 2, 4]
generate_all_permutations(sequence)

lowercase__   :				list[int | str]      =   ["A", "B", "C"]







generate_all_permutations(sequence_a)