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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;


int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	int n;
	cin>>n;
	vector<pair<pii, int>> V0, V1;

	int tsu = 0;
	for(int i=0;i<n;i++) {
		string s;
		cin>>s;
		int su = 0, mi = 0;
		for(auto ct:s) {
			su += (ct == '(')?1 : -1;
			mi = min(mi, su);
		}
		tsu += su;
		if(su > 0) {
			V0.push_back(make_pair(make_pair(-mi, su), i+1));
		} else {
			V1.push_back(make_pair(make_pair(su-mi, -su), i+1));
		}
	}
	if(tsu != 0)  {
			cout<<"impossible\n";
			return 0;
		}
	sort(V0.begin(), V0.end());
	sort(V1.begin(), V1.end());
	vector<int> ans0, ans1;
	int cs = 0;
	for(auto ct: V0) {
		if(cs-ct.first.first < 0) {
			cout<<"impossible\n";
			return 0;
		}
		cs += ct.first.second;
		ans0.push_back(ct.second);
	}
	cs = 0;
	for(auto ct: V1) {
		if(cs-ct.first.first < 0) {
			cout<<"impossible\n";
			return 0;
		}
		cs += ct.first.second;
		ans1.push_back(ct.second);
	}
	for(auto ct: ans0) {
		cout<<ct<<'\n';
	}
	reverse(all(ans1));

	for(auto ct: ans1) {
		cout<<ct<<'\n';
	}
}