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

using ll=long long;
//#define int ll
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define all(x) begin(x),end(x)
#define sz(x) (int)((x).size())
using pii=pair<int,int>;
using vi=vector<int>;
#define fi first
#define se second
#define pb push_back



signed main() {
	cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int n;
    cin >> n;
    vector<array<int, 3>> pos, neg;
    int total = 0;
    for(int i = 0; i < n; i++) {
        string s;
        cin >> s;
        int bal = 0, minbal = 0;
        for(auto i : s) {
            bal += i =='(' ? 1 : -1;
            minbal = min(minbal, bal);
        }
        if(bal >= 0) pos.push_back({minbal, bal,1+i});
        else {//same sht from the end
            reverse(all(s));
            for(auto &i : s) i ^= '('^')';int bal = 0, minbal = 0;
            for(auto i : s) {
                bal += i =='(' ? 1 : -1;
                minbal = min(minbal, bal);
            }
            neg.push_back({minbal, bal,1+i});
        }
        total += bal;
    }
    auto check = [&](vector<array<int, 3>> &a) {
        sort(all(a), greater<>());
        int cur = 0;
        for(auto [minbal, bal, id] : a) {
            if(cur + minbal < 0) return false;
            cur += bal;
        }
        return true;
    };
    if(total || !check(pos)) cout << "impossible\n";
    else if(!check(neg)) cout << "impossible\n";
    else {
        reverse(all(neg));
        for(auto [x,y,i] : pos) cout << i << "\n";
        for(auto [x,y,i] : neg) cout << i << "\n";
    }
}