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

#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define F first
#define S second
using ll = long long;
using ii = pair<ll, ll>;
using ld = long double;

struct St
{
    string s;
    int id;
    int net;
    int mn;
    auto operator<=>(const St& o) const
    {
        return tie(mn, net) <=> tie(o.mn, o.net);
    }
};

int main()
{
    cin.tie(0)->sync_with_stdio(0);

    int n; cin>>n;
    St a[n];
    forn(i,0,n)
    {
        string s; cin>>s;
        int sum = 0;
        int mn = 0;
        for (const auto c : s)
        {
            if (c == '(') sum++;
            else sum--;
            mn = min(mn, sum);
        }
        a[i] = {s, i, sum, mn};
    }
    sort(a, a + n, greater<>());
    int sum = 0;
    forn(i,0,n)
    {
        for (const auto x : a[i].s)
        {
            if (x == '(') sum++;
            else sum--;
        }
        if (sum < 0)
        {
            cout<<"impossible\n";
            return 0;
        }
    }
    if (sum != 0)
    {
        cout<<"impossible\n";
        return 0;
    }
    forn(i, 0, n) cout << a[i].id + 1 << '\n';

    return 0;
}