




def      lowerCamelCase_						(			UpperCamelCase__							: int = 5000_0000 )	->			int:





				"""simple docstring"""


				__lowerCamelCase									=       set()
				__lowerCamelCase									=       int((limit - 24) ** (1 / 2) )

				__lowerCamelCase									=       set(range(3					,	prime_square_limit + 1					,	2 ) )
				primes.add(2 )
				for p in range(3					,	prime_square_limit + 1					,	2 ):
								if p not in primes:
												continue
								primes.difference_update(set(range(p * p					,	prime_square_limit + 1					,	UpperCamelCase__ ) ) )

				for primea in primes:
								__lowerCamelCase									=       primea * primea
								for primea in primes:
												__lowerCamelCase									=       primea * primea * primea
												if square + cube >= limit - 16:
																break
												for primea in primes:
																__lowerCamelCase									=       primea * primea * primea * primea
																__lowerCamelCase									=       square + cube + tetr
																if total >= limit:
																				break
																ret.add(UpperCamelCase__ )

				return len(UpperCamelCase__ )


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








def      lowerCamelCase_						(			UpperCamelCase__							: str )	->			bool:





				"""simple docstring"""


				__lowerCamelCase									=       0
				for ch in input_str:
								__lowerCamelCase									=       ord(UpperCamelCase__ )
								__lowerCamelCase									=       pow(2					,	UpperCamelCase__ )

								# If we already turned on bit for current character's unicode
								if bitmap >> ch_unicode & 1 == 1:
												return False
								bitmap |= ch_bit_index_on
				return True


if __name__ == "__main__":
					import doctest

					doctest.testmod()


