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()
opening = 0
closing = 0
all_symbols = []
last_empty = -1
for i in range(len(s)):
    ch = s[i]
    if ch == '(':
        opening += 1
    elif ch == ')':
        closing += 1
    else:
        last_empty = i
    all_symbols.append(ch)
if len(s) - opening - closing > opening - closing or (last_empty == -1 and opening != closing):
    print(-1)
else:
    ans = []
    k = opening - closing
    cnt = 0
    for i in range(len(s)):
        ch = all_symbols[i]
        if ch == '#':
            if i == last_empty:
                ans.append(k)
                cnt -= k
            else:
                ans.append(1)
                k -= 1
                cnt -= 1
        elif ch == '(':
            cnt += 1
        else:
            cnt -= 1
        if cnt < 0:
            print(-1)
            exit()
    if cnt != 0:
        print(-1)
    else:
        for elem in ans:
            print(elem)
