#include <bits/stdc++.h>

using namespace std;

using i64 = long long;

void solve(){
    int n;
    cin >> n;
    vector<string>s(n);
    vector<int>d(n);
    for (int i = 0 ;i < n;i ++){
        cin >> s[i];
        int m = s[i].size();
        int k = count(s[i].begin(), s[i].end(), '(');
        d[i] = 2 * k - m;
    }

    vector<int>p(n);
    iota(p.begin(), p.end(), 0);
    sort(p.begin(), p.end(), [&](int x, int y){
        return d[x] > d[y];
    });

    i64 t = accumulate(d.begin(), d.end(), 0LL);
    if (t != 0){
        cout << -1 << "\n";
    }else{
        for (int i = 0;i < n;i ++){
            cout << p[i] + 1 << "\n";
        }
    }
}   

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T = 1;
    // cin >> T;
    while (T -- ){
        solve();
    }
    return 0;
}