
'''simple docstring'''





SCREAMING_SNAKE_CASE     =       """Alexander Joslin"""

import operator as op

from .stack import Stack







def snake_case_     (					lowercase__		):
  UpperCAmelCase__      :					List[Any]				       =							{"*": op.mul, "/": op.truediv, "+": op.add, "-": op.sub}

  UpperCAmelCase__      :					Stack[int]				       =							Stack()
  UpperCAmelCase__      :					Stack[str]				       =							Stack()

  for i in equation:
    if i.isdigit():
      # RULE 1
      operand_stack.push(int(lowercase__		)		)
    elif i in operators:
      # RULE 2
      operator_stack.push(lowercase__		)
    elif i == ")":
      # RULE 4
      UpperCAmelCase__      :					int				       =							operator_stack.peek()
      operator_stack.pop()
      UpperCAmelCase__      :					Tuple				       =							operand_stack.peek()
      operand_stack.pop()
      UpperCAmelCase__      :					List[Any]				       =							operand_stack.peek()
      operand_stack.pop()

      UpperCAmelCase__      :					Optional[Any]				       =							operators[opr](lowercase__   ,       lowercase__		)
      operand_stack.push(lowercase__		)

    # RULE 5
  return operand_stack.peek()


if __name__ == "__main__":
      SCREAMING_SNAKE_CASE     =       """(5 + ((4 * 2) * (2 + 3)))"""
      # answer = 45
      print(F'{equation} = {dijkstras_two_stack_algorithm(equation)}')





'''simple docstring'''





def snake_case_     (					lowercase__		):
  return sum(i for i in range(1   ,       number // 2 + 1		) if number % i == 0		) == number


if __name__ == "__main__":
      print("""Program to check whether a number is a Perfect number or not...""")
      SCREAMING_SNAKE_CASE     =       int(input("""Enter number: """).strip())
      print(F'{number} is {"" if perfect(number) else "not "}a Perfect Number.')



