

'''simple docstring'''
from collections import Counter
from timeit import timeit


def  a__       (    _SCREAMING_SNAKE_CASE   :       Optional[Any] = ""	,				)     ->					str:


	"""simple docstring"""





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


def  a__       (    _SCREAMING_SNAKE_CASE   :       Optional[int] = ""				)     ->					Optional[Any]:


	"""simple docstring"""





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

	for character in lower_case_input_str:
		UpperCAmelCase_     :      Optional[int]						=  character_freq_dict.get(snake_case__	,				0				) + 1
	UpperCAmelCase_     :      Tuple						=  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__       (    _SCREAMING_SNAKE_CASE   :       Optional[int] = ""				)     ->					List[str]:


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




def 						A							(  snake_case__		,					snake_case__     ):




			'''simple docstring'''


			SCREAMING_SNAKE_CASE__										=   len(snake_case__     )
			SCREAMING_SNAKE_CASE__										=   len(snake_case__     )
			SCREAMING_SNAKE_CASE__										=   (
			    first_str_length if first_str_length > second_str_length else second_str_length
			)
			SCREAMING_SNAKE_CASE__										=   []
			for char_count in range(snake_case__     ):
						if char_count < first_str_length:
									output_list.append(first_str[char_count]     )
						if char_count < second_str_length:
									output_list.append(second_str[char_count]     )
			return "".join(snake_case__     )


if __name__ == "__main__":
						print(alternative_string_arrange("AB", "XYZ"), end=" ")


