#include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#define REP(i,n) for(int i=0;i<n;i++)
typedef long long ll;

using namespace std;
int kaijo(int n){
	int ans = 1;
	if (n != 0){
		for (int i = 0; i < n; i++){
			ans *= (n - i);
		}
	}
	else{
		ans = 1;
	}
	return ans;
}

int main(){
	int n;
	int a = 0;
	int b = 0;
	int c;
	int z;
	int ans[200000];
	string s;
	cin >> n >> s;
	while (1){
	
		a = (int)s.find("(",a);
		if (a == -1){
			break;
		}
		if (s[a + 1] == ')'){
			ans[a] = a + 1;
			ans[a + 1] = a;
			
			s[a] = 'a';
			s[a + 1] = 'a';

		//	cout << s << endl;
			a = 0;
			
		}
		else if (s[a + 1] == 'a'){
			b = a;
		/*	while (1){
				if (s[b + 1] == 'a'){
					b++;
				}
				else{
					break;
				}
		
			}*/
			b = (int)s.find(")", a+1);
			c = (int)s.find("(", a+1);

			if (b>c){
				ans[a] = b ;
				ans[b] = a;
				s[a] = 'a';
				s[b] = 'a';
				a = 0;
			}
		//	cout << s << endl;
			
		}
		else if(a!=-1){
			a++;
			
		}
		



		
	}
	REP(i, n){
		cout << ans[i] +1<< endl;
	}
	return 0;
}