



"""simple docstring"""
from collections import Counter
from timeit import timeit



def 			lowercase	(_snake_case = "" ,)       ->    Optional[int]:




  '''simple docstring'''







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



def 			lowercase	(_snake_case = ""			)       ->    Optional[int]:




  '''simple docstring'''







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

  for character in lower_case_input_str:
    __UpperCamelCase  						=							character_freq_dict.get(_snake_case ,0			) + 1
  __UpperCamelCase  						=							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	(_snake_case = ""			)       ->    str:




  '''simple docstring'''







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


if __name__ == "__main__":
 _A													=   input(
     "Enter string to determine if it can be rearranged as a palindrome or not: "
 ).strip()
 benchmark(check_str)
 _A													=   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'''





def 							lowerCamelCase	(					_snake_case	:    int = 50_000_000							):





    '''simple docstring'''


    lowercase__									=    set()
    lowercase__									=    int((limit - 24) ** (1 / 2)							)

    lowercase__									=    set(range(3  ,prime_square_limit + 1  ,2							)							)
    primes.add(2							)
    for p in range(3  ,prime_square_limit + 1  ,2							):
        if p not in primes:
            continue
        primes.difference_update(set(range(p * p  ,prime_square_limit + 1  ,_snake_case							)							)							)

    for primea in primes:
        lowercase__									=    primea * primea
        for primea in primes:
            lowercase__									=    primea * primea * primea
            if square + cube >= limit - 16:
                break
            for primea in primes:
                lowercase__									=    primea * primea * primea * primea
                lowercase__									=    square + cube + tetr
                if total >= limit:
                    break
                ret.add(_snake_case							)

    return len(_snake_case							)


if __name__ == "__main__":
 print(f'''{solution() = }''')




