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.
def imprime_resultado(jogo_velha, sobra):
    for i in range(jogo_velha - 1):
        print(1)
    print(sobra + 1)

string = input()

abre = 0
fecha = 0
jogo_velha = 0

for char in string:
    if char == '(':
        abre += 1
    elif char == ')':
        fecha += 1
    else:
        jogo_velha += 1

dif = abre - fecha

if dif < 0 or jogo_velha > dif:
    print(-1)

else:
    sobra = dif - jogo_velha
    count = 0

    for i in range(len(string) - 1, -1, -1):
        if string[i] == '(':
            count -= 1
        elif string[i] == ')':
            count += 1
        else:
            imprime_resultado(jogo_velha, sobra)
            break
        
        if count < 0:
            print(-1)
            break
   	  			 	 		 	   	 	   						