#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>

using namespace std;

#define all(x) (x).begin(), (x).end()

const int N = 1e6 + 3;
const int INF = 1e9;

int m[N], s[N], n;

struct SegmentTree{
    pair<int, int> mx[4 * N];

    void init(const vector<int> &p, int i = 0, int l = 0, int r = n - 1){
        if(l == r){
            mx[i] = {s[p[l]] - m[p[l]], l};
            return;
        }
        int mid = (l + r) >> 1;
        init(p, 2 * i + 1, l, mid);
        init(p, 2 * i + 2, mid + 1, r);
        mx[i] = max(mx[2 * i + 1], mx[2 * i + 2]);
    }

    pair<int, int> query(int sl, int sr, int i = 0, int l = 0, int r = n - 1){
        if(sr < l || r < sl) return {-INF, -1};
        if(sl <= l && r <= sr) return mx[i];
        int mid = (l + r) >> 1;
        return max(query(sl, sr, 2 * i + 1, l, mid), query(sl, sr, 2 * i + 2, mid + 1, r));
    }

    void update(int s, int i = 0, int l = 0, int r = n - 1){
        if(s < l || r < s) return;
        if(l == r){
            mx[i] = {-INF, l};
            return;
        }
        int mid = (l + r) >> 1;
        update(s, 2 * i + 1, l, mid);
        update(s, 2 * i + 2, mid + 1, r);
        mx[i] = max(mx[2 * i + 1], mx[2 * i + 2]);
    }
} st;

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

    cin >> n;

    int total_sum = 0;
    for(int i = 0; i < n; ++i){
        string str;
        cin >> str;
        for(char c: str){
            s[i] += c == '(' ? 1 : -1;
            m[i] = min(m[i], s[i]);
        }
        total_sum += s[i];
        // cout << s[i] << " - " << m[i] << endl;
    }

    if(total_sum != 0){
        cout << "impossible\n";
        return 0;
    }

    vector<int> p(n);
    std::iota(all(p), 0);
    sort(all(p), [&](int l, int r){
        return m[l] > m[r];
    });

    st.init(p);

    int prefix = 0;
    vector<int> ans;
    for(int i = 0; i < n; ++i){
        int l = 0, r = n - 1;
        while(l != r){
            int mid = (l + r + 1) >> 1;
            if(prefix + m[p[mid]] >= 0)
                l = mid;
            else
                r = mid - 1;
        }

        int to = l;
        // cout << to << " to" << endl;
        auto [mx, pos] = st.query(0, to);
        if(mx == -INF){
            cout << "impossible\n";
            return 0;
        }

        st.update(pos);
        if(prefix + m[p[pos]] < 0){
            cout << "impossible\n";
            return 0;
        }

        prefix += s[p[pos]];
        ans.push_back(p[pos]+ 1);
    }

    for(int x: ans)
        cout << x << "\n";
}