#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ll LINF=1e18;
const ld PI=abs(acos(-1));
int n,k;
string s;
stack<pair<char,int>> st;

int main(){
	cin >> n >> s;
	
	int li[200010];
	REP(i,0,n){
		if(st.size() and st.top().first=='(' and s[i]==')'){
			li[i]=st.top().second;
			li[st.top().second]=i;
			st.pop();
		}else st.push(make_pair(s[i],i));
	}
	
	REP(i,0,n) cout << li[i]+1 << endl;
	return 0;
}