from collections import Counter
from timeit import timeit




def    lowerCAmelCase_  (		lowercase:				str = ""	,       )     ->					bool:







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




def    lowerCAmelCase_  (		lowercase:				str = ""		)     ->					bool:







 '''simple docstring'''
 if len(lowercase		) == 0:
  return True
 _UpperCamelCase:  List[str]    						=			input_str.replace(''' '''	,       ''''''		).lower()
 # character_freq_dict: Stores the frequency of every character in the input string
 _UpperCamelCase:  dict[str, int]    						=			{}

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







 '''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__":
  UpperCAmelCase_           =				input(
      '''Enter string to determine if it can be rearranged as a palindrome or not: '''
  ).strip()
  benchmark(check_str)
  UpperCAmelCase_           =				can_string_be_rearranged_as_palindrome_counter(check_str)
  print(f"""{check_str} can {'' if status else 'not '}be rearranged as a palindrome""")
# coding=utf-8
# Copyright 2023 The HuggingFace Inc. team.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
#     http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.

# this script dumps information about the environment

import os
import platform
import sys


UpperCAmelCase_           =				'''3'''

print('''Python version:''', sys.version)

print('''OS platform:''', platform.platform())
print('''OS architecture:''', platform.machine())

try:
  import torch

  print('''Torch version:''', torch.__version__)
  print('''Cuda available:''', torch.cuda.is_available())
  print('''Cuda version:''', torch.version.cuda)
  print('''CuDNN version:''', torch.backends.cudnn.version())
  print('''Number of GPUs available:''', torch.cuda.device_count())
except ImportError:
  print('''Torch version:''', None)

try:
  import transformers

  print('''transformers version:''', transformers.__version__)
except ImportError:
  print('''transformers version:''', None)