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.
works = True
inp = input()
left = len(inp.split('('))-1
right = len(inp.split(')'))-1
symb = len(inp.split('#'))-1
diff = left - right
if diff <= 0:
    works = False
l = []
for x in range(symb-1):
    l.append(1)
l.append(diff - symb + 1)
st = inp.split('#')
n = st.pop()
st = ")".join(st)
for x in range(l[-1]):
    st = st + ')'
left = 0
right = 0
for x in st:
    if x == '(':
        left += 1
    else:
        right += 1
    if right > left:
        works = False
        break
if works:
    for x in l:
        print(x)
else:
    print(-1)
