def 	lowerCamelCase					(	UpperCamelCase     :				List[Any]							)   ->    Optional[Any]:
		_lowerCamelCase				   =  []
		_lowerCamelCase				   =  set({'(', '[', '{'}							)
		_lowerCamelCase				   =  set({')', ']', '}'}							)
		_lowerCamelCase				   =  {'{': '}', '[': ']', '(': ')'}

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

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

		return len(UpperCamelCase							) == 0


def 	lowerCamelCase					(	)   ->    Optional[Any]:
		_lowerCamelCase				   =  input('Enter sequence of brackets: '							)
		if is_balanced(UpperCamelCase							):
				print(UpperCamelCase			,       'is balanced'							)
		else:
				print(UpperCamelCase			,       'is not balanced'							)


if __name__ == "__main__":
				main()
def 	lowerCamelCase					(	UpperCamelCase     :				int							)   ->    bool:
		_lowerCamelCase				   =  (1 + 24 * n) ** 0.5
		return ((1 + root) / 6) % 1 == 0


def 	lowerCamelCase					(	UpperCamelCase     :				int = 50_00							)   ->    int:
		_lowerCamelCase				   =  [(i * (3 * i - 1)) // 2 for i in range(1			,       UpperCamelCase							)]
		for i, pentagonal_i in enumerate(UpperCamelCase							):
				for j in range(UpperCamelCase			,       len(UpperCamelCase							)							):
						_lowerCamelCase				   =  pentagonal_nums[j]
						_lowerCamelCase				   =  pentagonal_i + pentagonal_j
						_lowerCamelCase				   =  pentagonal_j - pentagonal_i
						if is_pentagonal(UpperCamelCase							) and is_pentagonal(UpperCamelCase							):
								return b

		return -1


if __name__ == "__main__":
				print(F'''{solution() = }''')