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

int main()
{
    int n;
    cin >> n;
    vector<pii> reql, reqr;
    vector<int> dif(n+1), op(n+1, 0), opp(n);
    for (int i=1; i<=n; i++){
        string s;
        cin >> s;
        int left = 0, right = 0, need = 0;
        for (char c : s){
            if (c == '(') left++;
            else right++;
            if (left + need < right) need++;
        }
        dif[i] = left - right;
        if (left > right){
            reql.push_back({need, i});
        }
        else{
            left = 0; right = 0; need = 0;
            for (int i=s.size()-1; i>=0; i--){
                if (s[i] == '(') left++;
                else right++;
                if (right + need < left) need++;
            }
            reqr.push_back({need, i});
        }
    }
    reql.push_back({0, 0});
    reqr.push_back({0, 0});
    sort(reql.begin(), reql.end());
    sort(reqr.begin(), reqr.end());
    priority_queue<pii> pq;
    int ind = 0, provl = 0, cnt = 1, provr = 0;
    while (ind + 1 < reql.size() && !reql[ind+1].fi){
        ind++;
        pq.push({dif[reql[ind].se], reql[ind].se});
    }
    while (!pq.empty()){
        pii p = pq.top();
        pq.pop();
        provl += p.fi;
        op[p.se] = cnt;
        cnt++;
        while (ind + 1 < reql.size() && reql[ind+1].fi <= provl){
            ind++;
            pq.push({dif[reql[ind].se], reql[ind].se});
        }
        while (ind > 0 && reql[ind].fi > provl){
            if (!op[reql[ind].se]){
                cout << -1;
                return 0;
            }
            ind--;
        }
    }
    ind = 0;
    cnt = n;
    while (ind + 1 < reqr.size() && !reqr[ind+1].fi){
        ind++;
        pq.push({-1*dif[reqr[ind].se], reqr[ind].se});
    }
    while (!pq.empty()){
        pii p = pq.top();
        pq.pop();
        provr += p.fi;
        op[p.se] = cnt;
        cnt--;
        while (ind + 1 < reqr.size() && reqr[ind+1].fi <= provr){
            ind++;
            pq.push({-1*dif[reqr[ind].se], reqr[ind].se});
        }
        while (ind > 0 && reqr[ind].fi > provr){
            if (!op[reqr[ind].se]){
                cout << -1;
                return 0;
            }
            ind--;
        }
    }
    if (provl != provr){
        cout << -1;
        return 0;
    }
    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 << " ";
    }
}