

"""simple docstring"""




from collections import Counter
from timeit import timeit

def 						A							(  snake_case__ = ""		,					):




			'''simple docstring'''


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

def 						A							(  snake_case__ = ""     ):




			'''simple docstring'''


			if len(snake_case__     ) == 0:
						return True
			SCREAMING_SNAKE_CASE__										=   input_str.replace(""" """		,					""""""     ).lower()
			# character_freq_dict: Stores the frequency of every character in the input string
			SCREAMING_SNAKE_CASE__										=   {}

			for character in lower_case_input_str:
						SCREAMING_SNAKE_CASE__										=   character_freq_dict.get(snake_case__		,					0     ) + 1
			SCREAMING_SNAKE_CASE__										=   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							(  snake_case__ = ""     ):




			'''simple docstring'''


			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__":
						A_				:      Dict           =			input(
						    "Enter string to determine if it can be rearranged as a palindrome or not: "
						).strip()
						benchmark(check_str)
						A_				:      str           =			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 numpy as np

def 						A							(  snake_case__     ):




			'''simple docstring'''


			return (2 / (1 + np.exp(-2 * vector     ))) - 1


if __name__ == "__main__":
						import doctest

						doctest.testmod()


