




"""simple docstring"""







def      __snake_case (				_lowercase    ):


    """simple docstring"""







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

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

    for x in infix:
        if x.isalpha() or x.isdigit():
            post_fix.append(_lowercase    )  # if x is Alphabet / Digit, add it to Postfix
        elif x == "(":
            stack.append(_lowercase    )  # 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(_lowercase    ) == 0:
                stack.append(_lowercase    )  # If stack is empty, push x to stack
            else:  # while priority of x is not > priority of element in the stack
                while len(_lowercase    ) > 0 and priority[x] <= priority[stack[-1]]:
                    post_fix.append(stack.pop()    )  # pop stack & add to Postfix
                stack.append(_lowercase    )  # push x to stack

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

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

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





def      __snake_case (				_lowercase    ):


    """simple docstring"""







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

    for i in range(len(_lowercase    )    ):
        if infix[i] == "(":
            UpperCamelCase              =	''')'''  # change "(" to ")"
        elif infix[i] == ")":
            UpperCamelCase              =	'''('''  # change ")" to "("

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


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



'''simple docstring'''






from __future__ import annotations

from fractions import Fraction





def lowerCamelCase__     (		__lowerCamelCase			:				int			,       __lowerCamelCase			:				int				):







   '''simple docstring'''




   return (
       num != den and num % 1_0 == den // 1_0 and (num // 1_0) / (den % 1_0) == num / den
   )





def lowerCamelCase__     (		__lowerCamelCase			:				int				):







   '''simple docstring'''




   _UpperCAmelCase  :  Optional[int]				       =[]
   _UpperCAmelCase  :  Union[str, Any]				       =1_1
   _UpperCAmelCase  :  Union[str, Any]				       =int('1' + '0' * digit_len				)
   for num in range(__lowerCamelCase			,       __lowerCamelCase				):
      while den <= 9_9:
         if (num != den) and (num % 1_0 == den // 1_0) and (den % 1_0 != 0):
            if is_digit_cancelling(__lowerCamelCase			,       __lowerCamelCase				):
               solutions.append(f"{num}/{den}"				)
         den += 1
      num += 1
      _UpperCAmelCase  :  Optional[int]				       =1_0
   return solutions





def lowerCamelCase__     (		__lowerCamelCase			:				int = 2				):







   '''simple docstring'''




   _UpperCAmelCase  :  Any				       =1.0
   for fraction in fraction_list(__lowerCamelCase				):
      _UpperCAmelCase  :  List[str]				       =Fraction(__lowerCamelCase				)
      result *= frac.denominator / frac.numerator
   return int(__lowerCamelCase				)


if __name__ == "__main__":
 print(solution())

