


"""simple docstring"""






from collections import Counter
from timeit import timeit


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


def __lowercase     (      lowerCamelCase_  :      str = ""  ):
				if len(lowerCamelCase_  ) == 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(lowerCamelCase_						,					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 __lowercase     (      lowerCamelCase_  :      str = ""  ):
				print("\nFor string = "						,					lowerCamelCase_						,					":"  )
				print(
				    "> can_string_be_rearranged_as_palindrome_counter()"						,					"\tans ="						,					can_string_be_rearranged_as_palindrome_counter(lowerCamelCase_  )						,					"\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(lowerCamelCase_  )						,					"\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"""






from math import pi


def __lowercase     (      lowerCamelCase_  :      int						,					lowerCamelCase_  :      int  ):
				return 2 * pi * radius * (angle / 360)


if __name__ == "__main__":
	print(arc_length(90, 10))
