'''simple docstring'''

def __a (	__lowerCamelCase			:						int				)	->							Union[str, Any]:
      '''simple docstring'''


      lowercase_     =      []
      lowercase_     =      set({"(", "[", "{"}				)
      lowercase_     =      set({")", "]", "}"}				)
      lowercase_     =      {"{": "}", "[": "]", "(": ")"}

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

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

      return len(__lowerCamelCase				) == 0


def __a (	)	->							List[Any]:
      '''simple docstring'''


      lowercase_     =      input("Enter sequence of brackets: "				)
      if is_balanced(__lowerCamelCase				):
            print(__lowerCamelCase ,		"is balanced"				)
      else:
            print(__lowerCamelCase ,		"is not balanced"				)


if __name__ == "__main__":
       main()







'''simple docstring'''

import functools
from typing import Any


def __a (	__lowerCamelCase			:						str ,		__lowerCamelCase			:						list[str]				)	->							bool:
      '''simple docstring'''


      if not isinstance(__lowerCamelCase ,		__lowerCamelCase				) or len(__lowerCamelCase				) == 0:
            raise ValueError("the string should be not empty string"				)

      if not isinstance(__lowerCamelCase ,		__lowerCamelCase				) or not all(
          isinstance(__lowerCamelCase ,		__lowerCamelCase				) and len(__lowerCamelCase				) > 0 for item in words				):
            raise ValueError("the words should be a list of non-empty strings"				)

      # Build trie
      lowercase_     =      {}
      lowercase_     =      "WORD_KEEPER"

      for word in words:
            lowercase_     =      trie
            for c in word:
                  if c not in trie_node:
                        lowercase_     =      {}

                  lowercase_     =      trie_node[c]

            lowercase_     =      True

      lowercase_     =      len(__lowerCamelCase				)

      # Dynamic programming method
      @functools.cache
      def is_breakable(__lowerCamelCase			:						int				) -> bool:
            if index == len_string:
                  return True

            lowercase_     =      trie
            for i in range(__lowerCamelCase ,		__lowerCamelCase				):
                  lowercase_     =      trie_node.get(string[i] ,		__lowerCamelCase				)

                  if trie_node is None:
                        return False

                  if trie_node.get(__lowerCamelCase ,		__lowerCamelCase				) and is_breakable(i + 1				):
                        return True

            return False

      return is_breakable(0				)


if __name__ == "__main__":
       import doctest

       doctest.testmod()






