





"""simple docstring"""




def 						__snake_case						(				SCREAMING_SNAKE_CASE__     :						Union[str, Any]    )  ->       Dict:





     '''simple docstring'''

     _UpperCAmelCase      :     Tuple        =   []
     _UpperCAmelCase      :     Optional[int]        =   []
     _UpperCAmelCase      :     Dict        =   {
         '''^''': 3,
         '''*''': 2,
         '''/''': 2,
         '''%''': 2,
         '''+''': 1,
         '''-''': 1,
     }  # Priority of each operator
     _UpperCAmelCase      :     Tuple        =   len(lowerCAmelCase__    ) if (len(lowerCAmelCase__    ) > 7) else 7

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

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

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

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

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

def 						__snake_case						(				SCREAMING_SNAKE_CASE__     :						int    )  ->       Union[str, Any]:





     '''simple docstring'''

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

     for i in range(len(lowerCAmelCase__    )    ):
          if infix[i] == "(":
               _UpperCAmelCase      :     Union[str, Any]        =   ''')'''  # change "(" to ")"
          elif infix[i] == ")":
               _UpperCAmelCase      :     List[Any]        =   '''('''  # change ")" to "("

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


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





"""simple docstring"""




def 						__snake_case						(				SCREAMING_SNAKE_CASE__     :						Dict=28_123    )  ->       List[str]:





     '''simple docstring'''

     _UpperCAmelCase      :     List[Any]        =   [1] * (limit + 1)

     for i in range(2						,  int(limit**0.5    ) + 1    ):
          sum_divs[i * i] += i
          for k in range(i + 1						,  limit // i + 1    ):
               sum_divs[k * i] += k + i

     _UpperCAmelCase      :     Any        =   set()
     _UpperCAmelCase      :     List[str]        =   0

     for n in range(1						,  limit + 1    ):
          if sum_divs[n] > n:
               abundants.add(SCREAMING_SNAKE_CASE__    )

          if not any((n - a in abundants) for a in abundants    ):
               res += n

     return res


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