#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N;
std::string S;
stack<int> head;
int cor[252521];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N;
    std::cin >> S;

    for(int i=0;i<N;++i){
        if(S[i] == '('){
            head.emplace(i);
        }else{
            int x = head.top();
            head.pop();

            cor[x] = i;
            cor[i] = x;
        }
    }

    for(int i=0;i<N;++i){
        std::cout << (cor[i] + 1) << std::endl;
    }
}