





def 		A_				(     _lowerCAmelCase     )						-> Optional[int]:
 UpperCamelCase	:					Optional[int]       	=   []
 UpperCamelCase	:					Dict       	=   set({"(", "[", "{"}     )
 UpperCamelCase	:					Any       	=   set({")", "]", "}"}     )
 UpperCamelCase	:					List[Any]       	=   {"{": "}", "[": "]", "(": ")"}

 for i in range(len(_a     )     ):
  if s[i] in open_brackets:
   stack.append(s[i]     )

  elif s[i] in closed_brackets and (
      len(_a     ) == 0 or (len(_a     ) > 0 and open_to_closed[stack.pop()] != s[i])
  ):
   return False

 return len(_a     ) == 0



def 		A_				(     )						-> Union[str, Any]:
 UpperCamelCase	:					Dict       	=   input("Enter sequence of brackets: "     )
 if is_balanced(_a     ):
  print(_a							,   "is balanced"     )
 else:
  print(_a							,   "is not balanced"     )


if __name__ == "__main__":
    main()






'''simple docstring'''







import os





def 						snake_case_							():
    UpperCAmelCase			       =		os.path.join(os.path.dirname(_a     )    ,   '''num.txt'''     )
    with open(_a     ) as file_hand:
        return str(sum(int(_a     ) for line in file_hand     )     )[:1_0]


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




