// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#else
#define debug(x...) {};
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define double long double
#define int long long
#define MAXN 200010

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int n; cin >> n;
    struct node {
        int minv, sum, id;
    };
    vector<node> pos, neg;
    rep(i, 0, n) {
        string s; cin >> s;
        int minv = 0, sum = 0;
        rep(j, 0, s.length()) {
            if (s[j] == '(') sum++;
            else sum--;
            minv = min(minv, sum);
        }
        if (sum >= 0) pos.push_back({minv, sum, i+1});
        else neg.push_back({minv, sum, i+1});
    }
    sort(pos.begin(), pos.end(), [](node a, node b) {
        return a.minv > b.minv;
    });
    sort(neg.begin(), neg.end(), [](node a, node b) {
        return a.minv < b.minv;
    });
    int sum = 0;
    rep(i, 0, sz(pos)) {
        if (sum + pos[i].minv < 0) {
            print("impossible");
            return 0;
        }
        sum += pos[i].sum;
    }
    rep(i, 0, sz(neg)) {
        if (sum + neg[i].minv < 0) {
            print("impossible");
            return 0;
        }
        sum += neg[i].sum;
    }
    if (sum != 0) {
        print("impossible");
        return 0;
    }
    rep(i, 0, sz(pos)) cout << pos[i].id << endl;
    rep(i, 0, sz(neg)) cout << neg[i].id << endl;

    return 0;
}