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

struct sor{
    int mn;
    int sum;
    int idx;
    sor(int x,int y,int z){
        mn=x;
        sum=y;
        idx=z;
    }
    bool operator< (const sor &c) const {
        return mn < c.mn;
    }
};

int main(){
    int n;
    cin>>n;
    vector<sor> add, sub;
    for (int i=1;i<=n;i++){
        string s;
        cin>>s;
        int sum=0;
        int mn=1e6;
        for (char c : s){
            if (c=='(') sum++;
            else sum--;
            mn=min(mn, sum);
        }
        if (sum>=0) add.push_back(sor(mn, sum, i));
        else {
            int sum2=0;
            int mn2=1e6;
            for (int j=(int)s.size()-1;j>=0;--j){
                if (s[j]==')') sum2++;
                else sum2--;
                mn2=min(mn2, sum2);
            }
            sub.push_back(sor(mn2, sum2, i));
        }
    }
    sort(add.rbegin(), add.rend());
    sort(sub.rbegin(), sub.rend());
    vector<int> ans, ans2;
    int total=0;
    bool pos=true;

    for (auto i : add){
        if (total+i.mn<0) {
            pos=false; break;
        }
        ans.push_back(i.idx);
        total+=i.sum;
    }
    int total2=0;
    for (auto i : sub){
        if (total2+i.mn<0) {
            pos=false; break;
        }
        ans2.push_back(i.idx);
        total2+=i.sum;
    }

    if (!pos || total-total2!=0){
        cout<<-1;
        return 0;
    }

    for (int i : ans) cout<<i<<" ";
    reverse(ans2.begin(), ans2.end());
    for (int i : ans2) cout<<i<<" ";
}