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 collections
import os
import sys
from collections import Counter

if os.getenv('LOCALCFTEST'):
    sys.stdin = open('cfinput.txt')
else:
    input = sys.stdin.readline
MOD = 10 ** 9 + 7


def solve(s):
    ans = []
    stack = 0
    for c in s:
        if c == '(':
            stack += 1
        elif c == ')':
            if stack > 0:
                stack -= 1
                if stack < 0:
                    return print(-1)
            else:
                if ans:
                    ans[-1] -= 1
                    if ans[-1] <= 0:
                        return print(-1)
        else:
            if stack <= 0:
                return print(-1)
            ans.append(stack)
            stack = 0

    print('\n'.join(map(str, ans)))


if __name__ == '__main__':
    s = input()
    solve(s)
