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 = str(input())
kol_zv = s.count('#')
k = [0] * 2
h, m, n = 0, 0, 0
flag = True
for i in range(len(s)):
    if s[i] == '(':
        k[0] += 1
    if s[i] == ')':
        k[1] += 1
    if s[i] == '#':
        h += 1
        k[1] += 1
    if h == kol_zv:
        m = k[0]
        n = k[1] - h
    if k[0] < k[1]:
        flag = False
if flag and (m - n - kol_zv + 1 > 0):
    for i in range(kol_zv - 1):
        print(1)
    print(m - n - kol_zv + 1)
else:
    print(-1)