from collections import Counter
from timeit import timeit



def 	__SCREAMING_SNAKE_CASE  (					__UpperCamelCase    :       str = "" ,     )							->					bool:







  """simple docstring"""





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



def 	__SCREAMING_SNAKE_CASE  (					__UpperCamelCase    :       str = ""	)							->					bool:







  """simple docstring"""





  if len(__UpperCamelCase	) == 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(__UpperCamelCase ,     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 	__SCREAMING_SNAKE_CASE  (					__UpperCamelCase    :       str = ""	)							->					None:







  """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__":
   __lowerCamelCase			: List[Any]							   =		input(
       '''Enter string to determine if it can be rearranged as a palindrome or not: '''
   ).strip()
   benchmark(check_str)
   __lowerCamelCase			: Union[str, Any]							   =		can_string_be_rearranged_as_palindrome_counter(check_str)
   print(F"""{check_str} can {"" if status else "not "}be rearranged as a palindrome""")

from numpy import exp, pi, sqrt



def 	__SCREAMING_SNAKE_CASE  (					__UpperCamelCase    :       Any ,     __UpperCamelCase    :       float = 0.0 ,     __UpperCamelCase    :       float = 1.0	)							->					int:







  """simple docstring"""





  return 1 / sqrt(2 * pi * sigma**2	) * exp(-((x - mu) ** 2) / (2 * sigma**2)	)


if __name__ == "__main__":
   import doctest

   doctest.testmod()
