#encoding=utf8

 
import sys

 
class Node():

    '''結(jié)點(diǎn)'''

    
    def __init__(self, number):

        self.number = number

        # 相連的其它結(jié)點(diǎn)

        self.linked_nodes = []

    
    def is_leaf(self):

        '''判斷是否是葉子結(jié)點(diǎn)'''

        
        return len(self.linked_nodes) <= 1

    
                    
class Tree():

    '''樹'''

    
    def __init__(self, str_input):

        '''創(chuàng)建新的樹'''

        
        # 結(jié)點(diǎn)數(shù)

        self.n = 0

        # 存儲葉子結(jié)點(diǎn)江耀，下標(biāo)表示結(jié)點(diǎn)的數(shù)字

        # 這樣掃描一遍數(shù)組第一個非0元素就是

        # 要刪除的葉子結(jié)點(diǎn)

        self.leaves  = [0] * (50 + 1)

        # 棧用于輔助解析字符串

        stack = []

        number = 0

        for i in range(0, len(str_input)):

            c = str_input[i]

            if c == '(':

                stack.append(c)

            elif c == ' ':

                continue

            elif c == ')':

                node1 = stack.pop()

                # 彈出'('

                stack.pop()

                if len(stack) == 0:

                    if node1.is_leaf():

                        self.leaves[node1.number] = node1

                    break

                # node2是node1的相連結(jié)點(diǎn)

                node2 = stack[-1]

                node1.linked_nodes.append(node2)

                node2.linked_nodes.append(node1)

                
                # 如果是葉子結(jié)點(diǎn)

                if node1.is_leaf():

                    self.leaves[node1.number] = node1

            # 數(shù)字

            else:

                if number == 0:

                    # 判斷下一個字符是不是數(shù)字

                    if (str_input[i + 1].isdigit()):

                        number += 10 * int(c)

                        continue

                    else:

                        number = int(c)

                        new_node = Node(number)

                        stack.append(new_node)

                        number = 0

                        self.n += 1

                else:

                    number += int(c)

                    new_node = Node(number)

                    stack.append(new_node)

                    number = 0

                    self.n += 1

    
    def delete_min_leaf(self):

        '''刪除最小的葉子結(jié)點(diǎn)，并返回該節(jié)點(diǎn)的數(shù)字'''

            
        for i in range(0, len(self.leaves)):

            node = self.leaves[i]

            if node != 0 and len(node.linked_nodes) == 1:

                node.linked_nodes[0].linked_nodes.remove(node)

                if (node.linked_nodes[0].is_leaf()):

                    self.leaves[node.linked_nodes[0].number] = node.linked_nodes[0]

                number = node.linked_nodes[0].number

                node.linked_nodes.pop()

                return str(number)

        
if __name__ == '__main__':

    
    for line in sys.stdin:

        tree = Tree(line.strip('\n'))

        for i in range(0, tree.n - 1):

            sys.stdout.write(tree.delete_min_leaf())

            if i != tree.n - 1 - 1:

                sys.stdout.write(' ')

        print ''