#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N;
	string S;
	cin >> N;
	cin >> S;
	vector<int> A(N, -1);
	vector<int> res(N, -1);
	int cur = 0;
	for (int i = 0; i < N; i++) {
		if (S[i] == '(') {
			A[cur] = i;
			cur++;
		}
		else {
			cur--;
			res[i] = A[cur];
		}
	}
	for (int i = 0; i < N; i++) {
		if (res[i] != -1) {
			res[res[i]] = i;
		}
	}
	for (int i = 0; i < N; i++) {
		cout << res[i] + 1 << endl;
	}
}