#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>
using namespace std;

int main()
{
	int N; cin >> N;
	string S; cin >> S;
	
	vector<int>A(N);

	stack<int>st;
	for (int i = 0; i < S.size(); i++) {
		if (S[i]==')') {
			int p = st.top();st.pop();

			A[p] = i;A[i] = p;
		}
		else st.push(i);
	}

	for (int i = 0; i < N; i++)cout << A[i]+1 << endl;

	return 0;
}