




from collections import Counter
from timeit import timeit

def      _SCREAMING_SNAKE_CASE     (				lowercase      :			str = ""      ,				):


      '''simple docstring'''



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

def      _SCREAMING_SNAKE_CASE     (				lowercase      :			str = ""	):


      '''simple docstring'''



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

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


      '''simple docstring'''



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


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






import argparse


_UpperCAmelCase						:  Union[str, Any]									=			"""docs/source/_static/js/custom.js"""





def    __lowerCamelCase      (					UpperCamelCase__ ):







							'''simple docstring'''






							with open(UpperCamelCase__  ,				encoding='utf-8'  ,				newline='\n' ) as f:
														snake_case_     							=       f.readlines()
							snake_case_     							=       0

							# First let's put the right version
							while not lines[index].startswith('const stableVersion =' ):
														index += 1
							snake_case_     							=       F'''const stableVersion = "v{version}"\n'''

							# Then update the dictionary
							while not lines[index].startswith('const versionMapping = {' ):
														index += 1

							# We go until the end
							while not lines[index].startswith('}' ):
														index += 1
							# We add the new version at the end
							lines[index - 1] += F'''    "v{version}": "v{version}",\n'''

							with open(UpperCamelCase__  ,				'w'  ,				encoding='utf-8'  ,				newline='\n' ) as f:
														f.writelines(UpperCamelCase__ )


if __name__ == "__main__":
					_UpperCAmelCase						:  int									=			argparse.ArgumentParser()
					parser.add_argument("""--version""", help="""Release version.""")
					_UpperCAmelCase						:  str									=			parser.parse_args()
					update_custom_js(args.version)




