



from collections import Counter
from timeit import timeit

def     __lowercase(	UpperCAmelCase__ = ""   ,   ):


      """simple docstring"""



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

def     __lowercase(	UpperCAmelCase__ = "" ):


      """simple docstring"""



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


      """simple docstring"""



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


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




def     __lowercase(	UpperCAmelCase__ ):


      """simple docstring"""



      lowerCamelCase								=		[]
      lowerCamelCase								=		[]
      lowerCamelCase								=		{
          "^": 3,
          "*": 2,
          "/": 2,
          "%": 2,
          "+": 1,
          "-": 1,
      }  # Priority of each operator
      lowerCamelCase								=		len(UpperCAmelCase__ ) if (len(UpperCAmelCase__ ) > 7) else 7

      # Print table header for output
      print(
          "Symbol".center(8 )   ,   "Stack".center(UpperCAmelCase__ )   ,   "Postfix".center(UpperCAmelCase__ )   ,   sep=" | "   ,   )
      print("-" * (print_width * 3 + 7) )

      for x in infix:
            if x.isalpha() or x.isdigit():
                  post_fix.append(UpperCAmelCase__ )  # if x is Alphabet / Digit, add it to Postfix
            elif x == "(":
                  stack.append(UpperCAmelCase__ )  # if x is "(" push to Stack
            elif x == ")":  # if x is ")" pop stack until "(" is encountered
                  while stack[-1] != "(":
                        post_fix.append(stack.pop() )  # Pop stack & add the content to Postfix
                  stack.pop()
            else:
                  if len(UpperCAmelCase__ ) == 0:
                        stack.append(UpperCAmelCase__ )  # If stack is empty, push x to stack
                  else:  # while priority of x is not > priority of element in the stack
                        while len(UpperCAmelCase__ ) > 0 and priority[x] <= priority[stack[-1]]:
                              post_fix.append(stack.pop() )  # pop stack & add to Postfix
                        stack.append(UpperCAmelCase__ )  # push x to stack

            print(
                x.center(8 )   ,   ("".join(UpperCAmelCase__ )).ljust(UpperCAmelCase__ )   ,   ("".join(UpperCAmelCase__ )).ljust(UpperCAmelCase__ )   ,   sep=" | "   ,   )  # Output in tabular format

      while len(UpperCAmelCase__ ) > 0:  # while stack is not empty
            post_fix.append(stack.pop() )  # pop stack & add to Postfix
            print(
                " ".center(8 )   ,   ("".join(UpperCAmelCase__ )).ljust(UpperCAmelCase__ )   ,   ("".join(UpperCAmelCase__ )).ljust(UpperCAmelCase__ )   ,   sep=" | "   ,   )  # Output in tabular format

      return "".join(UpperCAmelCase__ )  # return Postfix as str

def     __lowercase(	UpperCAmelCase__ ):


      """simple docstring"""



      lowerCamelCase								=		list(infix[::-1] )  # reverse the infix equation

      for i in range(len(UpperCAmelCase__ ) ):
            if infix[i] == "(":
                  lowerCamelCase								=		")"  # change "(" to ")"
            elif infix[i] == ")":
                  lowerCamelCase								=		"("  # change ")" to "("

      return (infix_2_postfix("".join(UpperCAmelCase__ ) ))[
          ::-1
      ]  # call infix_2_postfix on Infix, return reverse of Postfix


if __name__ == "__main__":
     a_						:     str	     =		input('\nEnter an Infix Equation = ')  # Input an Infix equation
     a_						:     List[Any]	     =		''.join(Infix.split())  # Remove spaces from the input
     print('\n\t', Infix, '(Infix) -> ', infix_2_prefix(Infix), '(Prefix)')