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.
s=input()
l=[]
c=0
c1=0
c2=0
x=0
y=0
for i in s:
    if(i=='('):
        c1+=1
    elif(i==')'):
        c2+=1
if(c1==c2 or c1<c2):
    print(-1)
else:
    for i in s:
        x=y
        y+=1
        if(i=='('):
            c+=1
        
        elif(i==')'):
            c-=1
        elif(i=='#'):
            x+=1
            while(s[x]==')'):
                c-=1
                x+=1
                if(x==len(s)):
                    break
            l.append(c)
            c=0
    for i in l:
        print(i)
