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()
ret = [None] * len(s)
bal = [None] * len(s)
b = 0
for i, c in enumerate(s):
    if c == '(':
        b += 1
    elif c == ')':
        b -= 1
    else:
        ret[i] = 1
        b -= 1
    if b < 0:
        print(-1)
        exit()
    bal[i] = b
rem = bal[-1]
d = 0
for i, c in enumerate(s):
    bal[i] -= d
    if c == '#':
        extra = min(bal[i], rem)
        ret[i] += extra
        d += extra
        rem -= extra
print('\n'.join(map(str, filter(lambda x: x, ret))) if rem == 0 else -1)