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


a = s.count('(')
b = s.count(')')
c = s.count('#')

if a < b + c:
    print(-1)
else:
    rest = a - b
    ans = [1] * (c - 1) + [rest - c + 1] # greedy, put ) most right
    new_s = ''
    cnt = 0
    for c in s:
        if c != '#':
            new_s += c
        else:
            new_s += ')' * ans[cnt]
            cnt += 1
    flag = True
    l, r = 0 ,0
    #print(new_s)
    for c in new_s:
        #print(c)
        if c == '(':
            l += 1
        elif c == ')':
            r += 1
        #print(r, l)
        if r > l:

            flag = False
            break

    if flag:
        for num in ans:
            print(num)
    else:
        print(-1)

