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
s = input()
x = 0
y = 0
v = []
for _ in s:
    if _ == "(":
        x += 1
    elif _ == ")":
        x -= 1
    elif _ == "#":
        x -= 1
        v.append(1)
    if x < 0:
        print(-1)
        sys.exit()
v[-1] += x
i = 0
x = 0
for _ in s:
    if _ == "(":
        x += 1
    elif _ == ")":
        x -= 1
    elif _ == "#":
        x -= v[i]
        i += 1
    if x < 0:
        print(-1)
        sys.exit()
if x != 0:
	print(-1)
else:
	for _ in v:
		print(_)# 1698064613.8114018