


from collections import Counter
from timeit import timeit






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






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

							for character in lower_case_input_str:
														a__      =character_freq_dict.get(__a    ,     0     ) + 1
							a__      =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   _lowercase(					__a				:						str = ""     ):
							print('\nFor string = '    ,     __a    ,     ':'     )
							print(
							    '> can_string_be_rearranged_as_palindrome_counter()'    ,     '\tans ='    ,     can_string_be_rearranged_as_palindrome_counter(__a     )    ,     '\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(__a     )    ,     '\ttime ='    ,     timeit(
							        'z.can_string_be_rearranged_as_palindrome(z.check_str)'    ,     setup='import __main__ as z'    ,     )    ,     'seconds'    ,     )


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

def  __SCREAMING_SNAKE_CASE		(			lowerCamelCase_:							int ):
						"""simple docstring"""






						if number != int(lowerCamelCase_ ):
												raise ValueError("the value of input must be a natural number" )
						if number < 0:
												raise ValueError("the value of input must not be a negative number" )
						if number == 0:
												return 1
						snake_case   :			List[str]						    = [-1] * (number + 1)
						snake_case   :			str						    = 0
						for i in range(1     ,		number + 1 ):
												snake_case   :			Tuple						    = sys.maxsize
												snake_case   :			Optional[Any]						    = int(math.sqrt(lowerCamelCase_ ) )
												for j in range(1     ,		root + 1 ):
																		snake_case   :			List[str]						    = 1 + answers[i - (j**2)]
																		snake_case   :			List[str]						    = min(lowerCamelCase_     ,		lowerCamelCase_ )
												snake_case   :			Dict						    = answer
						return answers[number]


if __name__ == "__main__":
			import doctest

			doctest.testmod()



