#include <bits/stdc++.h>
#define fst first
#define snd second
#define fore(i,a,b) for(int i=a,ThxDem=b;i<ThxDem;++i)
#define pb push_back
#define ALL(s) s.begin(),s.end()
#define FIN ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define SZ(s) int(s.size())
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;

const int MAXN=1e6+10;
int s[MAXN],m[MAXN];

int cmp(int i, int j){
	if((s[i]>=0) != (s[j]>=0)) return s[i]>=0;
	int me=min(m[i],s[i]+m[j]);
	int he=min(m[j],s[j]+m[i]);
	return me>he;
}

int main(){FIN;
	int n; cin>>n;
	fore(i,0,n){
		string t; cin>>t;
		for(auto x:t){
			s[i]+=x=='('?1:-1;
			m[i]=min(m[i],s[i]);
		}
	}
	
	vector<int> id(n);
	fore(i,0,n) id[i]=i;
	sort(ALL(id),cmp);
	
	int sum=0,mn=0,bad=0;
	for(auto i:id){
		if(sum+m[i]<0) bad=1;
		sum+=s[i];
	}
	bad|=sum!=0;
	
	if(bad)cout<<"impossible\n";
	else{
		for(auto x:id)cout<<x+1<<" ";cout<<"\n";
	}
	
}