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.
a = input()
k = ''
f = 0
k1 = 0
k2 = 0
bulen = True
for i in range(a.count('#')-1):
    k+='1'
else:
    for i in range(a.count('(')-a.count(')')-a.count('#')+1):
        f+=1
    if f == 0:
        print(-1)
    else:
        k+=str(f)
a = a.replace('#',')',a.count('#')-1)
for i in a:
    if i =='(':
        k1 += 1
    if i == ')':
        k2+=1
    if i == '#':
        k2 += f
    if k1 < k2:
        bulen = False
if bulen:
    for i in k:
        print(i)
else:
    print(-1)