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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define subnb true
#define Lnb true
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

struct P {
    int first, second, idx;
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;
    vector<string> str(n);
    // )))(((
    vector<P> prs;
    rep(i, 0, n) {
        cin >> str[i];
        string s;
        for (char c : str[i]) {
            if(c == '(') s.push_back(c);
            else {
                if(!s.empty() && s.back() == '(') s.pop_back();
                else s.push_back(c);
            }
        }
        int l = 0, r = 0;
        for (char c : s) {
            l += (c == ')');
            r += (c == '(');
        }
        prs.push_back({l, r, i});
    }
    auto gsign = [](int x) {
        if(x < 0) return -1;
        else if(x == 0) return 0;
        else return 1;
    };
    sort(all(prs), [&](P p0, P p1) {
        int s0 = gsign(p0.second - p0.first);
        int s1 = gsign(p1.second - p1.first);
        if(s0 != s1) return s0 > s1;
        if(s0 == 1) {
            return p0.first < p1.first;
        }
        else if(s0 == 0) {return false;}
        else {
            return p0.second > p1.second;
        }
    });
    int cur = 0;
    for (auto p : prs) {
        cur -= p.first;
        if(cur < 0) {
            cout << "impossible\n";
            return 0;
        }
        cur += p.second;
    }
    if(cur) {
        cout << "impossible\n";
        return 0;
    }
    rep(i, 0, n) {
        cout << prs[i].idx + 1 << '\n';
    }

}