#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define fi first
#define se second
typedef long long ll;

int main()
{
    freopen("be2.txt", "r", stdin);
    int n;
    cin >> n;
    vector<pii> req(n+1);
    vector<int> dif(n+1), op(n+1, 0), opp(n);
    for (int i=1; i<=n; i++){
        string s;
        cin >> s;
        int sum = 0;
        int left=0, right=0, needed=0;
        for (char c : s){
            if (c == '(') left++;
            else right++;
            if (left + needed < right) needed++;
        }
        req[i] = make_pair(needed, i);
        dif[i] = left - right;
    }
    req[0] = {0,0};
    sort(req.begin(), req.end());
    priority_queue<pii> pq;
    int ind = 0, prov = 0, cnt = 1;
    while (!req[ind+1].fi){
        ind++;
        pq.push({dif[req[ind].se], req[ind].se});
    }
    while (!pq.empty()){
        pii p = pq.top();
        pq.pop();
        prov += p.fi;
        op[p.se] = cnt;
        cnt++;
        while (ind < n && req[ind+1].fi <= prov){
            ind++;
            pq.push({dif[req[ind].se], req[ind].se});
        }
        while (ind > 0 && req[ind].fi > prov){
            if (!op[req[ind].se]){
                cout << -1;
                return 0;
            }
            ind--;
        }
    }
    for (int i=1; i<=n; i++){
        if (!op[i]){
            cout << -1;
            return 0;
        }
        opp[op[i]-1] = i;
    }
    for (int x : opp){
        cout << x << " ";
    }
}