// compile: make data
// run: time ./data < data.in > data.out
#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 1000010
#define MAXM 12000000

struct node {
    int minv, sum, id;
};
node pos[MAXN], neg[MAXN];
char ch[MAXM];

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

    // int n; cin >> n;

    // int lenn = 0, lenp = 0;
    // rep(i, 0, n) {
    //     // string ch; cin >> ch;
    //     scanf("%s", ch);
    //     int minv = 0, sum = 0;
    //     int len = strlen(ch);
    //     rep(j, 0, len) {
    //         if (ch[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});
    //     if (sum >= 0) pos[lenp++] = {minv, sum, i+1};
    //     else neg[lenn++] = {minv, sum, i+1};
    // }

    int n = 0, p = 0;
    fread(ch, 1, MAXM, stdin);
    while (ch[p] != '\n') n = n * 10 + ch[p++] - '0';
    while (ch[p] == '\n') ++p;
    int minv = 0, sum = 0;
    int lenp = 0, lenn = 0;
    for (int i = 0; i < n; ++p) {
        if (ch[p] == '\n') {
            if (sum >= 0) pos[lenp++] = {minv, sum, i + 1};
            else neg[lenn++] = {minv, sum, i + 1};
            ++i;
            minv = sum = 0;
            continue;
        }
        sum += (ch[p] == '(' ? 1 : -1);
        minv = min(minv, sum);
    }


    sort(pos, pos + lenp, [](node a, node b) {
        return a.minv > b.minv;
    });
    sort(neg, neg + lenn, [](node a, node b) {
        return a.minv < b.minv;
    });
    sum = 0;
    rep(i, 0, lenp) {
        if (sum + pos[i].minv < 0) {
            cout << "impossible" << endl;
            return 0;
        }
        sum += pos[i].sum;
    }
    rep(i, 0, lenn) {
        if (sum + neg[i].minv < 0) {
            cout << "impossible" << endl;
            return 0;
        }
        sum += neg[i].sum;
    }
    if (sum != 0) {
        cout << "impossible" << endl;
        return 0;
    }
    rep(i, 0, lenp) printf("%lld\n", pos[i].id);
    rep(i, 0, lenn) printf("%lld\n", neg[i].id);

    return 0;
}