#!/usr/bin/env python
# coding: utf-8

# James Teo  T12902120

def arrange_tablets(tablets):
    count = []  # store count of each tablet 
    result = []  # result of arrangement of the tablets 
    
    # i is the tablet number, tablet is the current tablet
    for i, tablet in enumerate(tablets):
        open_count = tablet.count('(') # for each "(" count plus 1
        close_count = tablet.count(')') # for each ")" count minus 1
        total_count = open_count - close_count # sum of the count of the tablet
        
        # if the sum of count is positive place the tablet in the front of the arrangement
        if total_count >= 0:
            # check if the tablet starts with '(' beacuse the first tablet needs to start with '('
            if tablet[0] == '(':   
                count.insert(0,total_count)
                result.insert(0,i+1)
            # if tablet count is positive but starts with ")" place it at the 2nd place
            else:
                count.insert(1,total_count)
                result.insert(1,i+1)
        # if tablet count is negative put it at the back
        else:
            count.append(total_count)
            result.append(i+1)
            
    # if the total sum of count for all tablet is 0, there is a solution 
    if sum(count) == 0:
        return " ".join(map(str, result))
    # if not impossible
    else:
        return ("impossible")

# Input type 1 
n = int(input())
tablets = [input().strip() for _ in range(n)]

# Input type 2
#tablet_input = input()
#tablets = [line for line in tablet_input.split(" ") if line.strip()]

# Call the function to arrange the tablets and check for proper nesting.
print (arrange_tablets(tablets))



#print (tablets)