
'''simple docstring'''



import os


def A ():
						_lowerCAmelCase    		=					os.path.join(os.path.dirname(__lowerCamelCase						)					,      """num.txt"""						)
						with open(__lowerCamelCase						) as file_hand:
												return str(sum(int(__lowerCamelCase						) for line in file_hand						)						)[:10]


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







'''simple docstring'''

__lowerCAmelCase				:      List[str]						      ="Alexander Joslin"

import operator as op

from .stack import Stack





def 		UpperCamelCase							(				_lowerCamelCase   :   str			):
    A__							=     {"*": op.mul, "/": op.truediv, "+": op.add, "-": op.sub}

    A__							=     Stack()
    A__							=     Stack()

    for i in equation:
        if i.isdigit():
            # RULE 1
            operand_stack.push(int(_lowerCamelCase			)			)
        elif i in operators:
            # RULE 2
            operator_stack.push(_lowerCamelCase			)
        elif i == ")":
            # RULE 4
            A__							=     operator_stack.peek()
            operator_stack.pop()
            A__							=     operand_stack.peek()
            operand_stack.pop()
            A__							=     operand_stack.peek()
            operand_stack.pop()

            A__							=     operators[opr](_lowerCamelCase		,			_lowerCamelCase			)
            operand_stack.push(_lowerCamelCase			)

    # RULE 5
    return operand_stack.peek()


if __name__ == "__main__":
  __lowerCAmelCase				:      Dict						      ="(5 + ((4 * 2) * (2 + 3)))"
  # answer = 45
  print(f"""{equation} = {dijkstras_two_stack_algorithm(equation)}""")



