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.
x=input()
c=False
j=0
g=0
f=[]
p=True
le=len(x)
while g<le:
    i=x[g]
    if i=="(":
        j+=1
    elif i==")":
        j-=1
    if j<0:
        p=False
    if i=="#":
        if j<=0:
            p=False
            break
        g+=1
        while g<le and x[g]==")":
            j-=1
            if j <= 0:
                p = False
            g+=1
        else:
            g-=1
        f+=[j]
        j=0
    g += 1
    #hفرق واحد
if p:
    print(*f,sep="\n")
else:
    print(-1)