#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <cstdlib>
#include <stack>
#include <queue>
#include <cmath>

#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define repp(i,j,k) for(int i=j;i>=k;i--)
#define llrep(i,j,k) for(long long int i=j;i<(long long int)k;i++)
#define Sort(x) sort(x.begin(),x.end()); 
#define vi vector<int>
#define vvi vector<vector<int>> 
#define ll long long
int mod=1e9+7;
const int INF = 1e9;

using namespace std;



int main(void) {
	int n;
	string s;
	cin >> n >> s;
	vector<int> v(n);
	stack<int> st;
	for (int i = 0; i<s.length(); i++) {
		if (s[i] == '(') st.push(i);
		if (s[i] == ')') {
			int temp = st.top();
			st.pop();
			v[temp] = i+1;
			v[i] = temp+1;
		}
	}
	for (int i = 0; i < n; i++) {
		cout << v[i] << endl;
	}
	return 0;
}