#include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;

cs int N = 1e6 + 5; 

int n;
int c[N], d[N];
string S; 
int type(int x) {
    return d[x] > 0 ? 0 : 1; 
}
int main() {
    #ifdef zqj
    freopen("1.in","r",stdin);
    #endif
    cin >> n; 
    vector <int> p(n);
    for(int i = 1; i <= n; i++) {
        p[i - 1] = i; 
        cin >> S; 
        int len = S.length();
        int cur = 0, mn = 0; 
        for(int j = 0; j < len; j++) {
            if(S[j] == '(') ++ cur; 
            if(S[j] == ')') -- cur; 
            mn = min(mn, cur);
        }
        c[i] = - mn;
        d[i] = cur; 
    }
    sort(p.begin(), p.end(), [](cs int & x, cs int & y) {
        if(type(x) != type(y)) {
            return type(x) < type(y);
        }
        if(type(x) == 0) {
            return c[x] < c[y];
        }
        else {
            return c[x] + d[x] > c[y] + d[y];
        }
    });
    int s = 0; 
    for(int x : p) {
        // cout << x << ' ' << c[x] << ' ' << d[x] << endl;
        if(s < c[x]) {
            cout << "impossible\n";
            return 0; 
        }
        s += d[x];
    }
    if(s != 0) {
        cout << "impossible\n";
        return 0; 
    }
    for(int x : p) cout << x << '\n';
    return 0; 
}