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()
N=S.count("#")
D=S.count("(")-S.count(")")-N+1
if D<=0:
         print(-1)
         sys.exit()
S=S.split("#")
S=")".join(S[:-1])+")"*D+S[-1]
Lvl=0
for C in S:
         if C=="(":
                  Lvl+=1
         if C==")":
                  Lvl-=1
         if Lvl<0:
                  print(-1)
                  sys.exit()
for I in range(N-1):
         print(1)
print(D)
