






from collections import Counter
from timeit import timeit






def 	UpperCamelCase	(							snake_case__  : str = ""						,):




     '''simple docstring'''






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






def 	UpperCamelCase	(							snake_case__  : str = ""	):




     '''simple docstring'''






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

     for character in lower_case_input_str:
          __snake_case      :str 							=    character_freq_dict.get(__snake_case						,0	) + 1
     __snake_case      :Optional[int] 							=    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 	UpperCamelCase	(							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__":
     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"""
import numpy as np

def 				_snake_case      (   __snake_case							:      np.ndarray   ):




   """simple docstring"""







   return 1 / (1 + np.exp(-vector   ))

def 				_snake_case      (   __snake_case							:      np.ndarray   ):




   """simple docstring"""







   return vector * sigmoid(__snake_case   )


if __name__ == "__main__":
 import doctest

 doctest.testmod()

