Malek has recently found a treasure map. While he was looking for a treasure he found a locked door. There was a string *s* written on the door consisting of characters '(', ')' and '#'. Below there was a manual on how to open the door. After spending a long time Malek managed to decode the manual and found out that the goal is to replace each '#' with one or more ')' characters so that the final string becomes beautiful. 

Below there was also written that a string is called beautiful if for each *i* (1 ≤ *i* ≤ |*s*|) there are no more ')' characters than '(' characters among the first *i* characters of *s* and also the total number of '(' characters is equal to the total number of ')' characters. 

Help Malek open the door by telling him for each '#' character how many ')' characters he must replace it with.
The first line of the input contains a string *s* (1 ≤ |*s*| ≤ 10<sup class="upper-index">5</sup>). Each character of this string is one of the characters '(', ')' or '#'. It is guaranteed that *s* contains at least one '#' character.
import sys
class Solution:
    def get_res(self, s):
        cur_c = 0
        cur_j = 0
        res = []
        for c in s[::-1]:
            if c == '#':
                cur_c += 1
                cur_j += 1
            elif c == '(':
                cur_c -= 1
                if cur_c < 0 and cur_j == 0:
                    return -1
            elif c == ')':
                cur_c += 1
        if cur_c > 0:
            return [-1]
        elif cur_c < 0 and cur_j == 0:
            return [-1]
        elif cur_j > 0:
            for i in range(cur_j - 1):
                res.append(1)
            res.append(1 - cur_c)
        return res
s = Solution()
# ss = ['(((#)((#)', '()((#((#(#()', '#', '(#)']
# for i, si in enumerate(ss):
#     for t in s.get_res(si):
#         print("%d\t%d" % (i, t))
for line in sys.stdin:
    line = line.strip()
    for t in s.get_res(line):
        print(t)

