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.
from sys import stdin
from sys import exit

live = True
if not live: stdin = open('data.in', 'r')

s = stdin.readline()
s = list(s)
limit = len(s)
lastOpen = []
for it in range(limit):
	if s[it] == '(':
		lastOpen += [it]
	if s[it] == ')':
		if len(lastOpen) == 0:
			print(-1)
			exit(0)
		s[it] = s[lastOpen[-1]] = 0
		lastOpen.pop(-1)

open = 0
ans = []
for it in s:
	if it == '(':
		open += 1
	if it == '#':	
		if open < 1:
			print(-1)
			exit(0)
		ans += [open]
		open = 0
if open > 0:
	print(-1)
	exit(0)

print('\n'.join(map(str, ans)))

if not live: stdin.close()