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 = input()
n = s.rfind("#")
error = 0
s1 = 0
s2 = 0
s3 = 0
s4 = s.count("(")
s5 = s.count(")")
s6 = 0
for num in range(n):
   if s[num]=="(" :
      s2 += 1
   elif s[num]==")":
      s3 += 1
   if s[num]=="#" :
         s1 += 1
         s3 += 1
   if s3 > s2:
      error=1
if s1+s5 < s4:
      s6 = s4-s5-s1
      s3 += s6
else:
   error = 1
for num in range(n,len(s)):
   if s[num]=="(" :
      s2 += 1
   elif s[num]==")":
      s3 += 1
   if s3 > s2:
      error=1
if error == 1:
   print(-1)
else:
   while s1>0:
      print(1)
      s1-=1
   print(s6)
   
