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()  # ���� ������
count_l = 0  # ���������� (
count_r = 0  # ���������� )
h = c.count('#')
ans = [1]*h
n = len(c)

flag = 1
a = [0]*(n+1)

for i in range(n):
    if c[i] == '(':
        a[i+1] = a[i]+1
        count_l += 1
    else:
        a[i+1] = a[i]-1
        count_r += 1
    if a[i+1] < 0:
        flag = 0
        break

if flag == 0:
    print(-1)
else:
    if count_l == count_r+a[n]:
        ans[h-1] += a[n]
        for i in range(h):
            print(ans[i])
    else:
        print(-1)