#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
string s; int n;
int ans[1000005];
int main(){
	cin>>n>>s;
	stack<int>S;
	rep(i,n){
		if(s[i]=='('){
			S.push(i+1);
		}
		else{
			int x = S.top(); S.pop();
			ans[x] = i+1;
			ans[i+1] = x;
		}
	}
	repn(i,n) printf("%d\n",ans[i]);
}