/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define isz(x) (int)x.size()
using namespace std;

const int mxN = 2e5 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;

int n;
pii p[mxN];
vi pos, neg;

bool cmp(int x, int y) {
	pii a = p[x], b = p[y];
	if(a.ff != b.ff) return (a.ff < b.ff);
	else return (a.ss > b.ss);
}

void kill() {
	cout << "impossible" << endl;
	exit(0);
}

void solve() {
	cin >> n;
	for(int i = 1; i <= n; ++i) {
		string s; cin >> s;
		int sum = 0;
		for(char c : s)
			sum += (c == '(' ? 1 : -1);
		if(sum >= 0) {
			int cur_sum = 0, cur_min = 0;
			for(char c : s) {
				cur_sum += (c == '(' ? 1 : -1);
				cur_min = min(cur_min, cur_sum);
			}
			pos.emplace_back(i);
			p[i] = {-cur_min, cur_sum};
		}
		else {
			reverse(all(s));
			int cur_sum = 0, cur_min = 0;
			for(char c : s) {
				cur_sum += (c == ')' ? 1 : -1);
				cur_min = min(cur_min, cur_sum);
			}
			neg.emplace_back(i);
			p[i] = {-cur_min, cur_sum};
		}
	}
	sort(all(pos), cmp);
	sort(all(neg), cmp);
	int cur_sum_pos = 0;
	for(int &val : pos) {
		if(p[val].ff > cur_sum_pos)
			kill();
		cur_sum_pos += p[val].ss;
	}

	int cur_sum_neg = 0;
	for(int &val : neg) {
		if(p[val].ff > cur_sum_neg)
			kill();
		cur_sum_neg += p[val].ss;
	}

	if(cur_sum_pos != cur_sum_neg)
		kill();

	reverse(all(neg));
	pos.insert(pos.end(), all(neg));

	for(int &val : pos)
		cout << val << "\n";
}

signed main() {

#ifndef CDuongg
    if(fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int t = 1; //cin >> t;
	while(t--) solve();

#ifdef CDuongg
	auto end = chrono::high_resolution_clock::now();
	cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
	cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}