#include <bits/stdc++.h>
using namespace std;
// https://space.bilibili.com/672346917

using LL = long long;

int main () {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << fixed << setprecision(12);

    int n;
    cin >> n;

    vector<array<int, 3>> pos, neg;
    vector<string> ss(n);
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        ss[i] = s;

        int mn = 0x3f3f3f3f;
        int tot = 0;
        for (char c : s) {
            tot += (c == '(' ? 1 : -1);
            mn = min(mn, tot);
        }

        if (tot >= 0) {
            pos.push_back({tot, mn, i});
        } else {
            neg.push_back({tot, mn, i});
        }
    }

    sort(pos.begin(), pos.end(), [&](auto u, auto v) {
        return u[1] == v[1] ? u[0] > v[0] : u[1] > v[1];
    });
    sort(neg.begin(), neg.end(), [&](auto u, auto v) {
        return u[1] == v[1] ? u[0] > v[0] : u[1] < v[1];
    });
    vector<int> p;
    for (auto [a, b, c] : pos) {
        p.push_back(c);
    }
    for (auto [a, b, c] : neg) {
        p.push_back(c);
    }

    int tot = 0, ok = 1;
    for (int x : p) {
        for (auto c : ss[x]) {
            tot += c == ')' ? -1 : 1;
            if (tot < 0) {
                ok = 0;
            }
        }
    }

    if (tot != 0) {
        ok = 0;
    }

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

    for (auto x : p) {
        cout << x + 1 << "\n";
    }

    return 0;
}