





from collections import Counter
from timeit import timeit
def 					_A	(		SCREAMING_SNAKE_CASE					:       str = ""	,	):





  """simple docstring"""



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





  """simple docstring"""



  if len(SCREAMING_SNAKE_CASE						) == 0:
    return True
  a__     : Any  =input_str.replace(" "	,	""						).lower()
  # character_freq_dict: Stores the frequency of every character in the input string
  a__     : dict[str, int]  ={}

  for character in lower_case_input_str:
    a__     : Any  =character_freq_dict.get(SCREAMING_SNAKE_CASE	,	0						) + 1
  a__     : List[str]  =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					:       str = ""						):





  """simple docstring"""



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


if __name__ == "__main__":
     UpperCAmelCase     :     List[Any]							=	input(
         """Enter string to determine if it can be rearranged as a palindrome or not: """
     ).strip()
     benchmark(check_str)
     UpperCAmelCase     :     Optional[int]							=	can_string_be_rearranged_as_palindrome_counter(check_str)
     print(F"""{check_str} can {'' if status else 'not '}be rearranged as a palindrome""")













def 					_A	(		SCREAMING_SNAKE_CASE					:       int = 1	,	SCREAMING_SNAKE_CASE					:       int = 1_000						):





  """simple docstring"""



  a__     : Any  =1
  a__     : Any  =0

  for divide_by_number in range(SCREAMING_SNAKE_CASE	,	digit + 1						):
    a__     : list[int]  =[]
    a__     : int  =numerator
    for _ in range(1	,	digit + 1						):
      if now_divide in has_been_divided:
        if longest_list_length < len(SCREAMING_SNAKE_CASE						):
          a__     : Optional[Any]  =len(SCREAMING_SNAKE_CASE						)
          a__     : List[str]  =divide_by_number
      else:
        has_been_divided.append(SCREAMING_SNAKE_CASE						)
        a__     : List[Any]  =now_divide * 10 % divide_by_number

  return the_digit


# Tests
if __name__ == "__main__":
     import doctest

     doctest.testmod()






