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.
import sys
input = lambda: sys.stdin.readline().rstrip()

S = input()
A = []
mi,ma=0,0
for c in S:
    if c=='(':
        mi+=1
        ma+=1
    elif c==')':
        mi=max(0,mi-1)
        ma-=1
    else:
        mi = 0
        ma = ma-1
    if ma<0 or ma<mi:
        exit(print(-1))
    A.append((mi,ma))
#print(A)
    
if A[-1][0]!=0:
    exit(print(-1))
    
ans = []
cur = 0
for c in S[::-1]:
    A.pop()
    
    if c==')':
        cur+=1
    elif c=='(':
        cur-=1
    else:
        t = max(1,A[-1][0]-cur)
        ans.append(t)
        cur+=t
        
for a in ans[::-1]:
    print(a)

    
    


        
    