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 = sys.stdin.readline

s = input()[:-1]
n = len(s)
d = []
x, a, b, a1, a2 = 0, 0, 0, 0, 0
for i in range(n-1, -1, -1):
    if s[i] == ')':
        a1 += 1
    elif s[i] == '(':
        if a1 > 0:
            a1 -= 1
        else:
            a2 += 1
    else:
        if x == 0:
            if a2 > 0:
                print(-1)
                exit()
            else:
                x = 1
                a = a1 + 1
        else:
            if a2 > a:
                d.append(a2-a+1)
                a = a1 + 1
                a1 = 0
                a2 = 0
            else:
                d.append(1)
                a = a1+a-a2+1
                a1 = 0
                a2 = 0

if a1 > 0 or a2 <= a:
    print(-1)
else:
    d.append(a2-a+1)
    for i in d[::-1]:
        print(i)
