#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    int N;
    cin >> N;
    string S;
    cin >> S;
    vector<int> V;
    vector<int> A(N+1);
    for ( int i = 0; i < N; i++ ) {
        if ( S[i] == '(' ) { V.push_back(i+1); }
        else {
            A[V.back()] = i+1;
            A[i+1] = V.back();
            V.pop_back();
        }
    }

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