#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <functional>

#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define MOD 1000000007
#define int long long
using ll = long long;
using namespace std;
constexpr int INF = 1LL << 50;
using P = pair<int, int>;

template <class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    else {
        return false;
    }
}
template <class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    else {
        return false;
    }
}
struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(20);
    }
} SETUP;

signed main() {
    int n; string s; cin >> n >> s;
    vector<int> acc(n + 1);
    rep(i, 0, n) {
        if (s[i] == '(') {
            acc[i]++;
        }
        else {
            acc[i + 1]--;
        }
    }
    rep(i, 0, n) {
        acc[i + 1] += acc[i];
    }

    rep(i, 0, n) {
        if (s[i] == '(') {
            rep(j, i+1, n) {
                if (acc[i] == acc[j]) {
                    cout << j + 1 << endl;
                    break;
                }
            }
        }
        else {
            for (int j = i - 1; j >= 0; j--) {
                if (acc[i] == acc[j]) {
                    cout << j + 1 << endl;
                    break;
                }
            }
        }
    }
}