#include <bits/stdc++.h>
// #pragma comment(linker, "/STACK:268435456");,
using namespace std;

#define int             long long
#define double          long double
#define pb              push_back
#define all(t)          (t).begin(), (t).end()
#define rep(i,j)        for(int i = 0; i < (j); ++i)
#define rrep(i,j)       for(int i = (j)-1; i >= 0; --i)
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
const char nl = '\n';
const double eps = 1e-6;
const int N = 1e5, mod = 1e9 + 7, inf = 1e18;

void solve()
{
    int n; cin >> n;
    vector<string> s(n);
    for(auto &i: s) cin >> i;
    vector<pair<pair<int, int>, int>> l, r;
    rep(i, n) {
        int cur = 0, mn = 0;
        for(auto c: s[i]) {
            cur += (c == '(') - (c == ')');
            mn = min(mn, cur);
        }
        reverse(all(s[i]));
        // if(cur >=0)
        // cout << mn << " l " << cur << nl;
        if(cur < 0) {
            cur = 0; mn = 0;
            for(auto c: s[i]) {
                cur += (c == ')') - (c == '(');
                mn = min(mn, cur);
            }
            r.pb({{abs(mn), cur}, i});
        // cout << mn << ' ' << cur << nl;

        }
        else l.pb({{abs(mn), cur}, i});
    }
    sort(all(l));
    sort(all(r));
    if(l[0].first.first != 0 || r[0].first.first != 0) {
        cout << "impossible\n"; return;
    }
    int cur1 = 0, cur2 = 0;
    rep(i, (int)l.size() - 1) {
        cur1 += (l[i].first.second - l[i+1].first.first);
        if(cur1 < 0) {
            cout << "impossible\n"; return;
        }
        cur1 += l[i+1].first.first;
    }
    // cout << cur1 << ' ';
    cur1 += l.back().first.second;
    rep(i, (int)r.size() - 1) {
        cur2 += (r[i].first.second - r[i+1].first.first);
        if(cur2 < 0) {
            cout << "impossible\n"; return;
        }
        cur2 += r[i+1].first.first;
    }
    cur2 += r.back().first.second;
    // cout << cur1 << ' ' << cur2 << nl;
    if(cur1 != cur2) {
        cout << "impossible\n"; return;
    }
    for(auto i: l) cout << i.second + 1 << nl;
    reverse(all(r));
    for(auto i: r) cout << i.second + 1 << nl;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(numeric_limits<double>::max_digits10);
    cout << setprecision(15) << fixed;
    #ifdef aak_local
       freopen("/Users/aak/Desktop/Comding/Competitive/input.txt","r",stdin);
       freopen("/Users/aak/Desktop/Comding/Competitive/output.txt","w",stdout);
    #endif
    int tt = 1;
    // cin >> tt;
    for(int i = 1; i <= tt; ++i)
    {
        // cout << "Case #" << i << ": ";
        solve();
    }
    return 0;
}