#include <bits/stdc++.h>
using namespace std;

using ll = long long;
//typedef long long ll;

#define INF (1LL << 31 - 1)
#define INFLL ((1LL << 62) - 1)
#define MOD int(1e9+7)
#define repi(i,j,n) for(int i = (j); i < (n); ++i)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) for (int i = n; i >= 0; --i)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()

int vx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, vy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};

inline bool check(int ux, int uy, int x, int y) {
  return (0 <= x and x < ux and 0 <= y and y < uy);
}

inline void init() {
    cin.tie(0);
    ios::sync_with_stdio(false);
}

stack<int> st;
int n;
string s;
map<int, int> mp;

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

  rep(i,n) {
    if (s[i] == ')') {
      int c = st.top();
      st.pop();
      mp[c] = i;
      mp[i] = c;
    }
    else {
      st.push(i);
    }
  }

  rep(i,n) {
    cout << mp[i] + 1 << "\n";
  }

  return 0;
}