#include <iostream> #include <string> #include <vector> #include <set> #include <map> #include <stack> #include <queue> #include <algorithm> #include <cstdio> #include <cstdlib> #include <cmath> using namespace std; using ll = long long; using P = pair<int, int>; const int MAX = 2e5; const int INF = 1e9; const int MOD = 1e9 + 7; // 4近傍、8近傍 int dx[] = {1, 0, -1, 0, 1, -1, -1, 1}; int dy[] = {0, 1, 0, -1, 1, 1, -1, -1}; int c[MAX]; int main() { // 入力 int N; cin >> N; string s; cin >> s; stack<int> st; for (int i = 0; i < N; i++) { if (s[i] == '(') { st.push(i); } else { c[i] = st.top(); c[c[i]] = i; st.pop(); } } // 解答 for (int i = 0; i < N; i++) { cout << c[i] + 1 << endl; } return 0; }