#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;

int n;
pii eff[1000006];

pair<vector<int>, int> solve(vector<int> ord)
{
    vector<int> sol;
    sort(all(ord), [&](int i, int j) { return eff[i].F > eff[j].F; });
    
    int idx = 0, sum = 0;
    priority_queue<pii> pq;
    auto update = [&]()
    {
        while (idx < ord.size() && eff[ord[idx]].F + sum >= 0)
            pq.push(pii(eff[ord[idx]].S, ord[idx])), idx++;
    };

    update();
    while (!pq.empty())
    {
        auto [add, i] = pq.top();
        pq.pop();

        if (sum + eff[i].F < 0) break;
        sum += eff[i].S;
        sol.emplace_back(i);
        update();
    }

    return make_pair(sol, sum);
}


signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n;
    vector<int> add, sub;
    for (int i = 1; i <= n; i++)
    {
        string s;
        cin >> s;
        int sum = 0, low = 0;
        for (auto c : s)
        {
            if (c == '(')
                sum++;
            else 
                sum--;
            low = min(sum, low);
        }
        if (sum >= 0)
        {
            eff[i] = pii(low, sum);
            add.emplace_back(i);
        }
        else 
        {
            eff[i] = pii(low - sum, -sum);
            sub.emplace_back(i);
        }
    }
    auto [sol1, s1] = solve(add);
    auto [sol2, s2] = solve(sub);
    if (sol1.size() + sol2.size() == n && s1 == s2)
    {
        for (auto i : sol1)
            cout << i << '\n';
        reverse(all(sol2));
        for (auto i : sol2)
            cout << i << '\n';
    }
    else 
        cout << "impossible\n";

}