#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

int val(string s) {
    int ret = 0;
    for (char ch : s) ret += (ch == '(' ? 1 : -1);
    return ret;
}

int cost1(string s) {
    int ret = 0, cur = 0;
    for (char ch : s) {
        cur += (ch == ')' ? 1 : -1);
        ret = max(ret, cur);
    }
    return ret;
}

int cost2(string s) {
    reverse(s.begin(), s.end());
    int ret = 0, cur = 0;
    for (char ch : s) {
        cur += (ch == '(' ? 1 : -1);
        ret = max(ret, cur);
    }
    return ret;
}

vector <int> solve(vector <pair <pair<int, int>, int>>& V) {
    int sum = 0, nxt = 0;
    priority_queue <pair <int, int>> pq;
    vector <int> ret;
    sort(V.begin(), V.end());

    while (true) {
        while (nxt<V.size() && V[nxt].first.first <= sum) {
            pq.push({ V[nxt].first.second,V[nxt].second });
            nxt++;
        }
        if (pq.empty()) break;
        sum += pq.top().first;
        ret.push_back(pq.top().second);
        pq.pop();
    }

    if (ret.size() < V.size()) { cout << -1; exit(0); }
    return ret;
}

int main()
{
    int n;
    string s;
    vector <int> v(1e5 + 1, 0);
    vector <int> c1(1e5 + 1, 0);
    vector <int> c2(1e5 + 1, 0);
    vector <pair <pair<int, int>, int>> V1;
    vector <pair <pair<int, int>, int>> V2;

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> s;
        v[i] = val(s);
        c1[i] = cost1(s);
        c2[i] = cost2(s);
        if (v[i] >= 0) V1.push_back({ {c1[i],v[i]},i });
        if (v[i] < 0) V2.push_back({ {c2[i],-v[i]},i });
    }

    vector <int> ans = solve(V1);
    vector <int> ans2 = solve(V2);
    reverse(ans2.begin(), ans2.end());
    for (int i : ans2) ans.push_back(i);

    int sum = 0;
    for (int i : ans) {
        if (c1[i] > sum) { cout << -1; return 0; }
        sum += v[i];
    }
    if (sum) { cout << -1; return 0; }
    for (int i : ans) cout << i << " ";
}