#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<functional>
#include<map>
using namespace std;
string S; int n, d[200009], c[200009], e[200009];
int main() {
	cin >> n >> S;
	for (int i = 0; i < S.size(); i++) {
		if (S[i] == '(')d[i + 1] = d[i] + 1;
		else d[i + 1] = d[i] - 1;
	}
	for (int i = 0; i <= n; i++) {
		if (i >= 1 && S[i - 1] == ')') { int V = c[d[i]]; e[V] = i; e[i] = V; }
		c[d[i]] = i + 1;
	}
	for (int i = 1; i <= n; i++)printf("%d\n", e[i]);
	return 0;
}