






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			:int          =						character_freq_dict.get(snake_case__	,0  ) + 1
     __snake_case			: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   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''')










from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_tokenizers_available, is_torch_available


lowerCamelCase__							=     {
    """configuration_canine""": ["""CANINE_PRETRAINED_CONFIG_ARCHIVE_MAP""", """CanineConfig"""],
    """tokenization_canine""": ["""CanineTokenizer"""],
}

try:
     if not is_torch_available():
          raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
     pass
else:
     lowerCamelCase__							=     [
         """CANINE_PRETRAINED_MODEL_ARCHIVE_LIST""",
         """CanineForMultipleChoice""",
         """CanineForQuestionAnswering""",
         """CanineForSequenceClassification""",
         """CanineForTokenClassification""",
         """CanineLayer""",
         """CanineModel""",
         """CaninePreTrainedModel""",
         """load_tf_weights_in_canine""",
     ]


if TYPE_CHECKING:
     from .configuration_canine import CANINE_PRETRAINED_CONFIG_ARCHIVE_MAP, CanineConfig
     from .tokenization_canine import CanineTokenizer

     try:
          if not is_torch_available():
               raise OptionalDependencyNotAvailable()
     except OptionalDependencyNotAvailable:
          pass
     else:
          from .modeling_canine import (
              CANINE_PRETRAINED_MODEL_ARCHIVE_LIST,
              CanineForMultipleChoice,
              CanineForQuestionAnswering,
              CanineForSequenceClassification,
              CanineForTokenClassification,
              CanineLayer,
              CanineModel,
              CaninePreTrainedModel,
              load_tf_weights_in_canine,
          )


else:
     import sys

     lowerCamelCase__							=     _LazyModule(__name__, globals()["""__file__"""], _import_structure, module_spec=__spec__)


