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=xx=input()
x=x.replace("()","")
x=x.split(")(")
f=[]
p=True
for y,i in enumerate(x):
    if y%2==0:
        i+=")"
    else:
        i="("+i
    h=0
    m=False
    for j in i[::-1]:
        if j=="(":
            h+=1
        elif j==")":
            h-=1
        else:
            if h<=0:
                m=True
    if h>0 and m:
        f+=[h]
    else:
        p=False
        break
if p:
    x1, x2, x3 = xx.count(")"), xx.count("#"), xx.count("(")
    if x3 - x1 >= x2:
        d = [1] * (x2 - 1)
        print(*d, sep="\n")
        print((x3 - x1) - (x2 - 1))
else:
    print(-1)