#include<bits/stdc++.h>
using namespace std;

int main(){
    // To get input n
    int count{0};
    cin >> count;

    queue<pair<int, int>> q; // a queue to save strings that haven't been used
    vector<int> result(0); // save permutation results 

    int parentheses{0}; // save the current score: numbers of '(' - numbers of ')' 

    // iterate *count* times to receive inputs
    for(int i = 0; i < count; i++){
        string s;
        int score{0};
        cin >> s;
        score = 2 * std::count(s.begin(), s.end(), '(') - s.length();

        if(parentheses + score >= 0 && (!result.empty() || s[0] != ')')){
            parentheses += score;
            result.emplace_back(i + 1);
        }else{
            q.emplace(make_pair(i + 1, score));
        }

        while(parentheses >= 0 && !q.empty()){
            if(parentheses + q.front().second > 0){
                parentheses += q.front().second;
                result.emplace_back(q.front().first);
                q.pop();
            }else{
                break;
            }
        }
    }

    while(parentheses >= 0 && !q.empty()){
        if(parentheses + q.front().second >= 0){
            parentheses += q.front().second;
            result.emplace_back(q.front().first);
            q.pop();
        }else{
            break;
        }
    }

    if(parentheses == 0 && !result.empty()){
        for(auto x: result) cout << x << " ";
    }else{
        cout << "impossible";
    }
}