#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

ll N;
string S;

int main(void) {
  cin >> N >> S;

  vector<ll> ans(N);
  stack<ll> stk;
  REP(i, 0, N) {
    if(S[i] == '(') stk.push(i);
    else {
      ans[i] = stk.top();
      ans[ans[i]] = i;
      stk.pop();
    }
  }

  REP(i, 0, N) cout << ans[i] + 1 << endl;
}