




"""simple docstring"""






def   _snake_case    (       lowercase__ = 2000000	):
				_lowerCamelCase  :    Optional[Any]					=					[0 for i in range(n + 1	)]
				_lowerCamelCase  :    Union[str, Any]					=					1
				_lowerCamelCase  :    Dict					=					1

				for i in range(2							,					int(n**0.5	) + 1	):
								if primality_list[i] == 0:
												for j in range(i * i							,					n + 1							,					_A	):
																_lowerCamelCase  :    Dict					=					1
				_lowerCamelCase  :    Dict					=					0
				for i in range(_A	):
								if primality_list[i] == 0:
												sum_of_primes += i
				return sum_of_primes


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





"""simple docstring"""






def   _snake_case    (       lowercase__ = 1000	):
				_lowerCamelCase,				_lowerCamelCase  :    Optional[int]					=					1, 1
				_lowerCamelCase  :    int					=					[]
				for i in range(1							,					n + 1	):
								_lowerCamelCase  :    Tuple					=					prev_numerator + 2 * prev_denominator
								_lowerCamelCase  :    str					=					prev_numerator + prev_denominator
								if len(str(lowercase__	)	) > len(str(lowercase__	)	):
												result.append(lowercase__	)
								_lowerCamelCase  :    Dict					=					numerator
								_lowerCamelCase  :    Optional[int]					=					denominator

				return len(lowercase__	)


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