


"""simple docstring"""





def      _snake_case						(						_snake_case				:			int = 4000000			):
      lowerCAmelCase					:	int       =   [0, 1]
      lowerCAmelCase					:	List[str]       =   0
      while fib[i] <= n:
            fib.append(fib[i] + fib[i + 1]			)
            if fib[i + 2] > n:
                  break
            i += 1
      lowerCAmelCase					:	int       =   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"""





# using dfs for finding eulerian path traversal


def      _snake_case						(						_snake_case				:			Optional[Any] ,   _snake_case				:			List[Any] ,   _snake_case				:			str ,   _snake_case				:			List[Any]=None			):
      lowerCAmelCase					:	Any       =   (path or []) + [u]
      for v in graph[u]:
            if visited_edge[u][v] is False:
                  lowerCAmelCase,      lowerCAmelCase					:	Union[str, Any]       =   True, True
                  lowerCAmelCase					:	int       =   dfs(_snake_case ,   _snake_case ,   _snake_case ,   _snake_case			)
      return path


def      _snake_case						(						_snake_case				:			Optional[int] ,   _snake_case				:			Dict			):
      lowerCAmelCase					:	Tuple       =   0
      lowerCAmelCase					:	Optional[Any]       =   -1
      for i in range(_snake_case			):
            if i not in graph.keys():
                  continue
            if len(graph[i]			) % 2 == 1:
                  odd_degree_nodes += 1
                  lowerCAmelCase					:	Optional[Any]       =   i
      if odd_degree_nodes == 0:
            return 1, odd_node
      if odd_degree_nodes == 2:
            return 2, odd_node
      return 3, odd_node


def      _snake_case						(						_snake_case				:			Tuple ,   _snake_case				:			List[Any]			):
      lowerCAmelCase					:	Any       =   [[False for _ in range(max_node + 1			)] for _ in range(max_node + 1			)]
      lowerCAmelCase,      lowerCAmelCase					:	Optional[int]       =   check_circuit_or_path(_snake_case ,   _snake_case			)
      if check == 3:
            print('''graph is not Eulerian'''			)
            print('''no path'''			)
            return
      lowerCAmelCase					:	Dict       =   1
      if check == 2:
            lowerCAmelCase					:	int       =   odd_node
            print('''graph has a Euler path'''			)
      if check == 1:
            print('''graph has a Euler cycle'''			)
      lowerCAmelCase					:	List[str]       =   dfs(_snake_case ,   _snake_case ,   _snake_case			)
      print(_snake_case			)


def      _snake_case						(						):
      lowerCAmelCase					:	Optional[Any]       =   {1: [2, 3, 4], 2: [1, 3], 3: [1, 2], 4: [1, 5], 5: [4]}
      lowerCAmelCase					:	Union[str, Any]       =   {1: [2, 3, 4, 5], 2: [1, 3], 3: [1, 2], 4: [1, 5], 5: [1, 4]}
      lowerCAmelCase					:	List[Any]       =   {1: [2, 3, 4], 2: [1, 3, 4], 3: [1, 2], 4: [1, 2, 5], 5: [4]}
      lowerCAmelCase					:	Optional[Any]       =   {1: [2, 3], 2: [1, 3], 3: [1, 2]}
      lowerCAmelCase					:	Any       =   {
          1: [],
          2: []
          # all degree is zero
      }
      lowerCAmelCase					:	List[str]       =   10
      check_euler(_snake_case ,   _snake_case			)
      check_euler(_snake_case ,   _snake_case			)
      check_euler(_snake_case ,   _snake_case			)
      check_euler(_snake_case ,   _snake_case			)
      check_euler(_snake_case ,   _snake_case			)


if __name__ == "__main__":
 main()


