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.
c = input()  # ������
a = 0  # ���������� �������� ������
b = 0  # ���������� �������� ������
ans = []  # �����
pos = -1  # ������� �������� ans
flag = 1  # ��� ������
i = 0
n = len(c)

while (i < n) and flag:
    if c[i] == '(':
        a += 1
    elif c[i] == ')':
        b += 1
    else:
        m = max(1, a-b)
        ans.append(m)
        b += m
        pos += 1
        
    tmp = pos
        
    while (b > a) and (pos > -1):  # ���� ���������� �������� ������ ������ ���������� ��������
        m = max(1, ans[pos]-(b-a))
        b -= ans[pos]-m
        ans[pos] = m
        pos -= 1
            
    pos = tmp
    if (b > a) and (pos != -1):
        flag = 0
        
    i += 1
        
if flag and (a == b):
    l = len(ans)
    for i in range(l):
        print(ans[i])
else:
    print(-1)