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=str(input())
l=[]
n=[]
count=0
ans=0
for k in s:
    if k=="#":
        count+=1
l=s.split("#")
for i in range(count+1):
    a=0
    b=0
    m=[]
    for j in l[i]:
        if j=="(":
            a+=1
        if j==")":
            b+=1
    m.append(a)
    m.append(b)
    n.append(m)
for k in range(count):
    if k==0:
        ans=(n[k][0]-n[k][1])-n[k+1][1]
        if ans==0:
            print(-1)
        else:
            print(ans)
    elif k==count-1:
        if n[k+1][0]==n[k+1][1]:
            ans=n[k][0]
            if ans==0:
                print(-1)
            else:
                print(ans)
        else:
            ans=n[k][0]-n[k+1][1]
            if ans==0:
                print(-1)
            else:
                print(ans)
    else:
        ans=n[k][0]-n[k+1][1]
        if ans==0:
            print(-1)
        else:
            print(ans)
    
        
        
