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 foo(a,b,c,s):
	count=0
	d={'(':0 ,')':0}
	diff=a-b
	l=[]
	count=0
	c1=diff
	for i in s:
		if(i=='#'):
			count+=1
			if(count!=c):
				l.append(count)
				c1=c1-count
			if(count==c):
				l.append(c1)
			#print(l,c1)
	
	for j in l:
		print(j)
	return
			
				

s=input()
a=s.count('(')
b=s.count(')')
c=s.count('#')
#print(a,b,c)
if(a==b):
	print(-1)
	

elif(a<b):
	print(-1)

else:
	foo(a,b,c,s)
	
			
	