Скобочные последовательности

mport itertools
 
s = itertools.permutations(input())
result = set()
for i in s:
    text = ''.join(i)
    while '()' in text or '{}' in text or '[]' in text:
        text = text.replace('()', '')
        text = text.replace('[]', '')
        text = text.replace('{}', '')
        if not text:
            result.add(''.join(i))
result = sorted(result)
for i in result:
    print(i)

def is_valid(s):
    stack = []
    for char in s:
        if char in '({[':
            stack.append(char)
        else:
            if not stack or \
               (char == ')' and stack[-1] != '(') or \
               (char == '}' and stack[-1] != '{') or \
               (char == ']' and stack[-1] != '['):
                return False
            stack.pop()
    return len(stack) == 0
 
def generate_brackets(s):
    brackets_count = {}
    for char in s:
        brackets_count[char] = brackets_count.get(char, 0) + 1
    
    for open_b, close_b in [('(', ')'), ('{', '}'), ('[', ']')]:
        if brackets_count.get(open_b, 0) != brackets_count.get(close_b, 0):
            return []
 
    result = set()
    def permutations(arr):
        if not arr: return [[]]
        curr_result = []
        seen = set()
        for i in range(len(arr)):
            if arr[i] in seen: continue
            seen.add(arr[i])
            for p in permutations(arr[:i] + arr[i+1:]):
                curr_result.append([arr[i]] + p)
        return curr_result
    
    for p in permutations(list(s)):
        seq = ''.join(p)
        if is_valid(seq):
            result.add(seq)
    
    return sorted(list(result))
 
s = input().strip()
if s and all(char in '(){}[]' for char in s):
    sequences = generate_brackets(s)
    if sequences:
        for seq in sequences:
            print(seq)

def v(s):
    st = []
    for c in s:
        if c in '({[':
            st.append(c)
        else:
            if not st or \
               (c == ')' and st[-1] != '(') or \
               (c == '}' and st[-1] != '{') or \
               (c == ']' and st[-1] != '['):
                return False
            st.pop()
    return len(st) == 0
 
def g(s):
    c = {}
    for ch in s:
        c[ch] = c.get(ch, 0) + 1
 
    for o, cl in [('(', ')'), ('{', '}'), ('[', ']')]:
        if c.get(o, 0) != c.get(cl, 0):
            return []
 
    r = set()
    def p(a):
        if not a: return [[]]
        cr = []
        se = set()
        for i in range(len(a)):
            if a[i] in se: continue
            se.add(a[i])
            for pe in p(a[:i] + a[i+1:]):
                cr.append([a[i]] + pe)
        return cr
 
    for pe in p(list(s)):
        sq = ''.join(pe)
        if v(sq):
            r.add(sq)
 
    return sorted(list(r))
 
s = input().strip()
if s and all(c in '(){}[]' for c in s):
    sqs = g(s)
    if sqs:
        for sq in sqs:
            print(sq)