


from collections import Counter
from timeit import timeit






def 			UpperCamelCase (     __magic_name__					:							str = ""   ,   )       ->  bool:
		"""simple docstring"""




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






def 			UpperCamelCase (     __magic_name__					:							str = ""					)       ->  bool:
		"""simple docstring"""




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

		for character in lower_case_input_str:
				lowercase__					      =		character_freq_dict.get(__magic_name__   ,   0					) + 1
		lowercase__					      =		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 (     __magic_name__					:							str = ""					)       ->  None:
		"""simple docstring"""




		print("""\nFor string = """   ,   __magic_name__   ,   """:"""					)
		print(
		    """> can_string_be_rearranged_as_palindrome_counter()"""   ,   """\tans ="""   ,   can_string_be_rearranged_as_palindrome_counter(__magic_name__					)   ,   """\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(__magic_name__					)   ,   """\ttime ="""   ,   timeit(
		        """z.can_string_be_rearranged_as_palindrome(z.check_str)"""   ,   setup="""import __main__ as z"""   ,   )   ,   """seconds"""   ,   )


if __name__ == "__main__":
	A	:		Union[str, Any]    =       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')





def 			UpperCamelCase (     __magic_name__					:							str   ,   __magic_name__					:							str					)       ->  list:
		"""simple docstring"""




		lowercase__					      =		len(__magic_name__					)
		lowercase__					      =		[]
		for i in range(len(__magic_name__					) - pat_len + 1					):
				lowercase__					      =		True
				for j in range(__magic_name__					):
						if s[i + j] != pattern[j]:
								lowercase__					      =		False
								break
				if match_found:
						position.append(__magic_name__					)
		return position


if __name__ == "__main__":
	assert naive_pattern_search('ABCDEFG', 'DE') == [3]
	print(naive_pattern_search('ABAAABCDBBABCDDEBCABC', 'ABC'))

