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()
c1=0
c2=0
c3=0
for i in range(len(s)):
    if s[i]=='(':
        c1+=1
    elif s[i]==')':
        c2+=1
    else:
        c3+=1
if c1>=c2+c3:
    x=0
    tf=True
    for i in range(len(s)-1,-1,-1):
        if s[i]=='#':
            ind=i
            break
    
    for i in range(len(s)):
        if s[i]=='(':
            x+=1
        else:
            x-=1
        if i==ind:
            bc=x
        if x<0:
            tf=False
            break
            
    if tf:
        if bc>=c1-(c2+c3):
            for _ in range(c3-1):
                print(1)
            print(1+c1-c2-c3)
        else:
            print(-1)

    else:
        print(-1)
else:
    print(-1)