


'''simple docstring'''




from collections import Counter
from timeit import timeit





def 	a_					( lowerCamelCase	:     str = ""	, ):
   return sum(c % 2 for c in Counter(input_str.replace(' '	, ''				).lower()				).values()				) < 2





def 	a_					( lowerCamelCase	:     str = ""				):
   if len(lowerCamelCase				) == 0:
      return True
   lowerCAmelCase     =			input_str.replace(' '	, ''				).lower()
   # character_freq_dict: Stores the frequency of every character in the input string
   lowerCAmelCase     =			{}

   for character in lower_case_input_str:
      lowerCAmelCase     =			character_freq_dict.get(lowerCamelCase	, 0				) + 1
   lowerCAmelCase     =			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 	a_					( lowerCamelCase	:     str = ""				):
   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__":
       __snake_case    						=input(
           """Enter string to determine if it can be rearranged as a palindrome or not: """
       ).strip()
       benchmark(check_str)
       __snake_case    						=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'''




print((lambda quine: quine % quine)("""print((lambda quine: quine %% quine)(%r))"""))





