





from collections import Counter
from timeit import timeit






def 		lowerCAmelCase  (	UpperCamelCase__   :   Optional[int] = ""       ,			)      ->    str:

						"""simple docstring"""





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






def 		lowerCAmelCase  (	UpperCamelCase__   :   int = ""					)      ->    List[Any]:

						"""simple docstring"""





						if len(UpperCAmelCase__					) == 0:
												return True
						__SCREAMING_SNAKE_CASE:				Union[str, Any]           =   input_str.replace(''' '''       ,			''''''					).lower()
						# character_freq_dict: Stores the frequency of every character in the input string
						__SCREAMING_SNAKE_CASE:				int           =   {}

						for character in lower_case_input_str:
												__SCREAMING_SNAKE_CASE:				str           =   character_freq_dict.get(UpperCAmelCase__       ,			0					) + 1
						__SCREAMING_SNAKE_CASE:				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  (	UpperCamelCase__   :   Union[str, Any] = ""					)      ->    Dict:

						"""simple docstring"""





						print('''\nFor string = '''       ,			UpperCAmelCase__       ,			''':'''					)
						print(
						    '''> can_string_be_rearranged_as_palindrome_counter()'''       ,			'''\tans ='''       ,			can_string_be_rearranged_as_palindrome_counter(UpperCAmelCase__					)       ,			'''\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(UpperCAmelCase__					)       ,			'''\ttime ='''       ,			timeit(
						        '''z.can_string_be_rearranged_as_palindrome(z.check_str)'''       ,			setup='''import __main__ as z'''       ,			)       ,			'''seconds'''       ,			)


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








from __future__ import annotations

def      __lowercase(						UpperCAmelCase__			):


      """simple docstring"""



      lowerCamelCase             =		2
      lowerCamelCase             =		[]
      while i * i <= n:
            if n % i:
                  i += 1
            else:
                  n //= i
                  factors.append(UpperCAmelCase__			)
      if n > 1:
            factors.append(UpperCAmelCase__			)
      return factors


if __name__ == "__main__":
     import doctest

     doctest.testmod()