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().strip()

A = []

b = 0
e = 0
for i in range(0, len(s)):
    if s[i] == ')':
        e += 1
    if s[i] == '(':
        b += 1

    if b < e:
        print('-1')
        exit()

    if s[i] == '#':
        A.append( b - e )

x = b - e
B = [1 for i in range(0, len(A))]
x = x - len(B)

if x < 0:
    print('-1')
    exit()

t = 0
i = 0
while x > 0 and i < len(B):
    t += 1
    if A[i] > t:
        r = min(x, (A[i] - t))
    B[i] += r
    x -= r
    t += r
    i += 1

if x > 0:
    print('-1')
    exit()

for s in B:
    print(s)