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 os
import sys
from io import BytesIO, IOBase
from collections import Counter, defaultdict
from sys import stdin, stdout
import io
import math
import heapq
import bisect
import collections
import copy
import collections, sys, threading


def ceil(a, b):
    return (a + b - 1) // b


inf = float('inf')


def get():
    return stdin.readline().rstrip()


mod = 10 ** 9 + 7
import collections, sys, threading

sys.setrecursionlimit(1500)
# for _ in range(int(get())):
# n=int(get())
# l=list(map(int,get().split()))
# = map(int,get().split())
##################################################
l=list(get())
x=0
t=0
k=0
for i in range(len(l)):
    if l[i]=="(":
        t+=1
        pass
    elif l[i]==")":
        t-=1
    elif l[i]=="#":
        t=0
        k+=1
        l[i]=")"
ans=0;f=0
if t>0:
    f=1
for i in range(len(l)):
    if l[i]=="(":
        x+=1
    elif l[i]==")":
        x-=1
        if x<0:
            f=1
            break
if f:
    print(-1)
else:
    for i in range(k-1):
        print(1)
    print(x+1)







