



from collections import Counter
from timeit import timeit
def 						UpperCamelCase      (  snake_case__			:       str = ""			,	)      ->	bool:
   return sum(c % 2 for c in Counter(input_str.replace(' '			,	''      ).lower()      ).values()      ) < 2
def 						UpperCamelCase      (  snake_case__			:       str = ""      )      ->	bool:
   if len(snake_case__      ) == 0:
      return True
   UpperCamelCase       :    Union[str, 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       :    List[Any]		      =      character_freq_dict.get(snake_case__			,	0      ) + 1
   UpperCamelCase       :    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 						UpperCamelCase      (  snake_case__			:       str = ""      )      ->	None:
   print('\nFor string = '			,	snake_case__			,	':'      )
   print(
       '> can_string_be_rearranged_as_palindrome_counter()'			,	'\tans ='			,	can_string_be_rearranged_as_palindrome_counter(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(snake_case__      )			,	'\ttime ='			,	timeit(
           'z.can_string_be_rearranged_as_palindrome(z.check_str)'			,	setup='import __main__ as z'			,	)			,	'seconds'			,	)


if __name__ == "__main__":
    __UpperCAmelCase			  =			input(
        '''Enter string to determine if it can be rearranged as a palindrome or not: '''
    ).strip()
    benchmark(check_str)
    __UpperCAmelCase			  =			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 						_lowerCAmelCase							(     _lowerCAmelCase			)    ->						list[int]:


						'''simple docstring'''






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


if __name__ == "__main__":
	import doctest

	doctest.testmod()





