


"""simple docstring"""


def   snake_case		(     UpperCamelCase__       :						int = 4000000    )   ->      int:
						lowerCamelCase					:					List[Any]        =	[0, 1]
						lowerCamelCase					:					Optional[Any]        =	0
						while fib[i] <= n:
												fib.append(fib[i] + fib[i + 1]    )
												if fib[i + 2] > n:
																		break
												i += 1
						lowerCamelCase					:					Any        =	0
						for j in range(len(UpperCamelCase__    ) - 1    ):
												if fib[j] % 2 == 0:
																		total += fib[j]

						return total


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








"""simple docstring"""


from __future__ import annotations

__lowerCamelCase      :int	    =		10




def   snake_case		(     UpperCamelCase__       :						list[int]    )   ->      list[int]:
      lowerCamelCase					:					int        =	1
      lowerCamelCase					:					Union[str, Any]        =	max(UpperCamelCase__    )
      while placement <= max_digit:
            # declare and initialize empty buckets
            lowerCamelCase					:					list[list]        =	[[] for _ in range(UpperCamelCase__    )]
            # split list_of_ints between the buckets
            for i in list_of_ints:
                  lowerCamelCase					:					Any        =	int((i / placement) % RADIX    )
                  buckets[tmp].append(UpperCamelCase__    )
            # put each buckets' contents into list_of_ints
            lowerCamelCase					:					Dict        =	0
            for b in range(UpperCamelCase__    ):
                  for i in buckets[b]:
                        lowerCamelCase					:					List[str]        =	i
                        a += 1
        # move to next
            placement *= RADIX
      return list_of_ints


if __name__ == "__main__":
    import doctest

    doctest.testmod()




