



def  __lowerCamelCase (       lowerCamelCase__ = 50_000_000						):

				"""simple docstring"""


				lowercase__					:   List[Any]													=					set()
				lowercase__					:   Any													=					int((limit - 24) ** (1 / 2)						)

				lowercase__					:   str													=					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					,			lowerCamelCase__						)						)						)

				for primea in primes:
								lowercase__					:   Optional[int]													=					primea * primea
								for primea in primes:
												lowercase__					:   Optional[int]													=					primea * primea * primea
												if square + cube >= limit - 16:
																break
												for primea in primes:
																lowercase__					:   Optional[int]													=					primea * primea * primea * primea
																lowercase__					:   Dict													=					square + cube + tetr
																if total >= limit:
																				break
																ret.add(lowerCamelCase__						)

				return len(lowerCamelCase__						)


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









from collections import Counter
from timeit import timeit


def  __lowerCamelCase (       lowerCamelCase__ = ""					,			):

				"""simple docstring"""


				return sum(c % 2 for c in Counter(input_str.replace(" "					,			""						).lower()						).values()						) < 2


def  __lowerCamelCase (       lowerCamelCase__ = ""						):

				"""simple docstring"""


				if len(lowerCamelCase__						) == 0:
								return True
				lowercase__					:   str													=					input_str.replace(" "					,			""						).lower()
				# character_freq_dict: Stores the frequency of every character in the input string
				lowercase__					:   dict[str, int]													=					{}

				for character in lower_case_input_str:
								lowercase__					:   List[Any]													=					character_freq_dict.get(lowerCamelCase__					,			0						) + 1
				lowercase__					:   List[Any]													=					0

				for character_count in character_freq_dict.values():
								if character_count % 2:
												odd_char += 1
				if odd_char > 1:
								return False
				return True


def  __lowerCamelCase (       lowerCamelCase__ = ""						):

				"""simple docstring"""


				print("\nFor string = "					,			lowerCamelCase__					,			":"						)
				print(
				    "> can_string_be_rearranged_as_palindrome_counter()"					,			"\tans ="					,			can_string_be_rearranged_as_palindrome_counter(lowerCamelCase__						)					,			"\ttime ="					,			timeit(
				        "z.can_string_be_rearranged_as_palindrome_counter(z.check_str)"					,			setup="import __main__ as z"					,			)					,			"seconds"					,			)
				print(
				    "> can_string_be_rearranged_as_palindrome()"					,			"\tans ="					,			can_string_be_rearranged_as_palindrome(lowerCamelCase__						)					,			"\ttime ="					,			timeit(
				        "z.can_string_be_rearranged_as_palindrome(z.check_str)"					,			setup="import __main__ as z"					,			)					,			"seconds"					,			)


if __name__ == "__main__":
				lowerCAmelCase__					  =  input(
				    '''Enter string to determine if it can be rearranged as a palindrome or not: '''
				).strip()
				benchmark(check_str)
				lowerCAmelCase__					  =  can_string_be_rearranged_as_palindrome_counter(check_str)
				print(f'''{check_str} can {"" if status else "not "}be rearranged as a palindrome''')




