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 = open("input.txt").readline().rstrip()
S = input().rstrip()
a, b, c = S.count("("), S.count(")"), S.count("#")
d = a - b
if d >= c:
	Res = [1] * (c - 1) + [d - c + 1]
	#print(Res)
	balans = 0
	flag = True
	for i in S:
		#print(balans, i)
		if i == "(":
			balans += 1
		elif i == ")":
			balans -= 1
		else:
			balans -= (d != Res[-1]) + d * (d == Res[-1])
			d -= 1
		if balans < 0:
			flag = False
		#print(balans, i)
	if flag:
		for i in Res:
			print(i)
	else:
		print(-1)
else:
	print(-1)