#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <stack>

using namespace std;
typedef  long long ll;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define  MP make_pair
#define  PB push_back
#define inf  1000000007

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

	return 0;
}