"""simple docstring"""


from collections import Counter
from timeit import timeit







def 					__a   (		A = ""    ,				):






     '''simple docstring'''



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







def 					__a   (		A = ""      ):






     '''simple docstring'''



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






     '''simple docstring'''



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


if __name__ == "__main__":
 lowerCAmelCase_:					Dict     =					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')





"""simple docstring"""


import itertools
import math







def 					__a   (		A      ):






     '''simple docstring'''



     if 1 < number < 4:
          # 2 and 3 are primes
          return True
     elif number < 2 or number % 2 == 0 or number % 3 == 0:
          # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
          return False

     # All primes number are in format of 6k +/- 1
     for i in range(5    ,				int(math.sqrt(A      ) + 1      )    ,				6      ):
          if number % i == 0 or number % (i + 2) == 0:
               return False
     return True







def 					__a   (		):






     '''simple docstring'''



     lowercase__				 =							2
     while True:
          if is_prime(A      ):
               yield num
          num += 1







def 					__a   (		A = 1_00_01      ):






     '''simple docstring'''



     return next(itertools.islice(prime_generator()    ,				nth - 1    ,				A      )      )


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




