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.

def solve():
    string = input().strip()

    # Counters for opened and closed parenthesis
    opened = 0

    # List with the solution
    solution = []

    for c in string:
        if c == '(':
            opened += 1
        else:
            # If ')' or '#'
            opened -= 1
            if c == '#':
                solution.append(1)
        if opened < 0:
            # There are more closed than opened parenthesis
            print(-1)
            return

    # The last element should be incremented with the amount of opened parenthesis
    # If we have more opened than closed parenthesis
    solution[-1] += opened

    # Output the answer
    for s in solution:
        print(s)

solve()