


from collections import Counter
from timeit import timeit


def 		lowercase_	(  _UpperCamelCase = ""							,      ):


			'''simple docstring'''







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


def 		lowercase_	(  _UpperCamelCase = ""	):


			'''simple docstring'''







			if len(_UpperCamelCase	) == 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(_UpperCamelCase							,      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 		lowercase_	(  _UpperCamelCase = ""	):


			'''simple docstring'''







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


if __name__ == "__main__":
	a			:			int												=					input(
	    '''Enter string to determine if it can be rearranged as a palindrome or not: '''
	).strip()
	benchmark(check_str)
	a			:			Tuple												=					can_string_be_rearranged_as_palindrome_counter(check_str)
	print(f'''{check_str} can {'' if status else 'not '}be rearranged as a palindrome''')






import doctest
from collections import deque

import numpy as np
class 						lowerCamelCase_							:



					'''simple docstring'''







					def __init__(					self    ) ->      None:







								'''simple docstring'''

								__lowercase			       = [2, 1, 2, -1]
								__lowercase			       = [1, 2, 3, 4]






					def A   (					self    ) ->      list[float]:







								'''simple docstring'''

								__lowercase			       = len(self.first_signal    )
								__lowercase			       = len(self.second_signal    )

								__lowercase			       = max(snake_case_			,							snake_case_    )

								# create a zero matrix of max_length x max_length
								__lowercase			       = [[0] * max_length for i in range(snake_case_    )]

								# fills the smaller signal with zeros to make both signals of same length
								if length_first_signal < length_second_signal:
											self.first_signal += [0] * (max_length - length_first_signal)
								elif length_first_signal > length_second_signal:
											self.second_signal += [0] * (max_length - length_second_signal)
								for i in range(snake_case_    ):
											__lowercase			       = deque(self.second_signal    )
											rotated_signal.rotate(snake_case_    )
											for j, item in enumerate(snake_case_    ):
														matrix[i][j] += item

        # multiply the matrix with the first signal
								__lowercase			       = np.matmul(np.transpose(snake_case_    )			,							np.transpose(self.first_signal    )    )

								# rounding-off to two decimal places
								return [round(snake_case_			,							2    ) for i in final_signal]


if __name__ == "__main__":
	doctest.testmod()


