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