from collections import Counter
from timeit import timeit






def     lowerCAmelCase_			(   _SCREAMING_SNAKE_CASE     :				int = ""		, ):
						return sum(c % 2 for c in Counter(input_str.replace(""" """		, """"""			).lower()			).values()			) < 2






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

						for character in lower_case_input_str:
												UpperCamelCase_		:							Optional[int]  =		character_freq_dict.get(_SCREAMING_SNAKE_CASE		, 0			) + 1
						UpperCamelCase_		:							Optional[int]  =		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_			(   _SCREAMING_SNAKE_CASE     :				Union[str, Any] = ""			):
						print("""\nFor string = """		, _SCREAMING_SNAKE_CASE		, """:"""			)
						print(
						    """> can_string_be_rearranged_as_palindrome_counter()"""		, """\tans ="""		, can_string_be_rearranged_as_palindrome_counter(_SCREAMING_SNAKE_CASE			)		, """\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(_SCREAMING_SNAKE_CASE			)		, """\ttime ="""		, timeit(
						        """z.can_string_be_rearranged_as_palindrome(z.check_str)"""		, setup="""import __main__ as z"""		, )		, """seconds"""		, )


if __name__ == "__main__":
	SCREAMING_SNAKE_CASE		:     str         =	input(
	    "Enter string to determine if it can be rearranged as a palindrome or not: "
	).strip()
	benchmark(check_str)
	SCREAMING_SNAKE_CASE		:     Optional[Any]         =	can_string_be_rearranged_as_palindrome_counter(check_str)
	print(F'''{check_str} can {"" if status else "not "}be rearranged as a palindrome''')









"""simple docstring"""
import cmath
import math




def 					a__						(						lowerCAmelCase			,	lowerCAmelCase			,	lowerCAmelCase			,	lowerCAmelCase    )	-> complex:
      UpperCAmelCase__			:							str							=    math.radians(lowerCAmelCase    )
      UpperCAmelCase__			:							Optional[int]							=    math.radians(lowerCAmelCase    )

      # Convert voltage and current to rectangular form
      UpperCAmelCase__			:							Union[str, Any]							=    cmath.rect(lowerCAmelCase			,	lowerCAmelCase    )
      UpperCAmelCase__			:							List[str]							=    cmath.rect(lowerCAmelCase			,	lowerCAmelCase    )

      # Calculate apparent power
      return voltage_rect * current_rect


if __name__ == "__main__":
    import doctest

    doctest.testmod()

