






def 						A_					(						lowercase_ = 4_0_0_0_0_0_0			)				->int:







 """simple docstring"""

 SCREAMING_SNAKE_CASE				    =		1
 SCREAMING_SNAKE_CASE				    =		2
 SCREAMING_SNAKE_CASE				    =		0
 while j <= n:
  if j % 2 == 0:
   total += j
  SCREAMING_SNAKE_CASE    ,   SCREAMING_SNAKE_CASE				    =		j, i + j

 return total


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







'''simple docstring'''


from __future__ import annotations

from collections.abc import Iterable, Iterator
from typing import Any, Generic, TypeVar

lowerCAmelCase__      				=			TypeVar("T", bound=bool)



class        lowercase    (	Generic[T]			):


							def __init__(      self     ,      _snake_case)				->					None:
								UpperCAmelCase_		:   T													=       value
								UpperCAmelCase_		:   SkewNode[T] | None													=       None
								UpperCAmelCase_		:   SkewNode[T] | None													=       None


							@property
							def     _snake_case				(      self)				->					T:
								return self._value





							@staticmethod
							def     _snake_case				(      _snake_case     ,      _snake_case)				->					SkewNode[T] | None:
								if not roota:
									return roota

								if not roota:
									return roota

								if roota.value > roota.value:
									UpperCAmelCase_						,     UpperCAmelCase_		:   Union[str, Any]													=       roota, roota

								UpperCAmelCase_		:   Dict													=       roota
								UpperCAmelCase_		:   Dict													=       roota.right
								UpperCAmelCase_		:   Optional[int]													=       roota.left
								UpperCAmelCase_		:   Dict													=       SkewNode.merge(_snake_case     ,      _snake_case)

								return result



class        lowercase    (	Generic[T]			):


							def __init__(      self     ,      _snake_case = ())				->					None:
								UpperCAmelCase_		:   SkewNode[T] | None													=       None
								if data:
									for item in data:
										self.insert(_snake_case)


							def __bool__(      self)				->					bool:
								return self._root is not None


							def __iter__(      self)				->					Iterator[T]:
								UpperCAmelCase_		:   list[Any]													=       []
								while self:
									result.append(self.pop())

								# Pushing items back to the heap not to clear it.
								for item in result:
									self.insert(_snake_case)

								return iter(_snake_case)


							def     _snake_case				(      self     ,      _snake_case)				->					None:
								UpperCAmelCase_		:   Any													=       SkewNode.merge(self._root     ,      SkewNode(_snake_case))


							def     _snake_case				(      self)				->					T | None:
								UpperCAmelCase_		:   Union[str, Any]													=       self.top()
								UpperCAmelCase_		:   Tuple													=       (
								    SkewNode.merge(self._root.left     ,      self._root.right) if self._root else None
								)

								return result


							def     _snake_case				(      self)				->					T:
								if not self._root:
									raise IndexError('Can\'t get top element for the empty heap.')
								return self._root.value





							def     _snake_case				(      self)				->					None:
								UpperCAmelCase_		:   Union[str, Any]													=       None


if __name__ == "__main__":
						import doctest

						doctest.testmod()






