#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <stack>

using namespace std;

int main() {
	int n;
	string s;
	cin >> n >> s;

	stack<int> st;

	vector<int> ans(n, -1); // 0-index
	for (int i = 0; i < n; i++) {
		if (s[i] == '(') {
			st.push(i);
		} else {
			int tmp = st.top();
			ans[tmp] = i;
			ans[i] = tmp;
			st.pop();
		}
	}

	for (auto x : ans) {
		cout << x + 1 << endl;
	}


	return 0;
}