#include<bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int N; cin >> N;

    int total_balance = 0;
    vector<int> good, bad;
    vector<pair<int, int>> v(N);
    for (int i =0; i < N; ++i) {
        string S; cin >> S;
        int minus = 0, plus = 0;
        int balance = 0, min_balance = 1e9;
        for (auto c : S) {
            if (c == ')') {
                minus++;
                balance -= 1;
            }
            else {
                plus++;
                balance += 1;
            }
            min_balance = min(min_balance, balance);
        }

        v[i] = {min_balance, balance};
        total_balance += balance;
        if (balance < 0) {
            bad.push_back(i);
        } else {
            good.push_back(i);
        }
    }

    if (total_balance != 0) {
        cout << "impossible\n";
    } else {
        sort(good.begin(), good.end(), [&](const auto& l, const auto& r) {
            return v[l].first > v[r].first;
        });
        sort(bad.begin(), bad.end(), [&](const auto& l, const auto& r) {
            return v[l].first - v[l].second < v[r].first - v[r].second;
        });

        int sum = 0;
        bool is_bad = false;
        for (auto id : good) {
            is_bad |= (sum + v[id].first < 0);
            sum += v[id].second;
        }
        for (auto id : bad) {
            is_bad |= (sum + v[id].first < 0);
            sum += v[id].second;
        }

        if (!is_bad) {
            for (int id : good) cout << id+1 << '\n';
            for (int id : bad) cout << id+1 << '\n';
        } else {
            cout << "impossible\n";
        }
    }
}