/*
Problem: 1167D
Date: 15-02-2024 07:22 AM
*/
#include <iostream>
#include <stack>
using namespace std;
int n;
string str;
stack<bool> s;
int main() {
cin >> n >> str;
for(int i = 0; i < n; i++) {
if(str[i] == '(') {
if(s.empty()) {
s.push(false);
cout << 0;
}else {
s.push(!s.top());
cout << s.top();
}
}else {
cout << s.top();
s.pop();
}
}
cout << endl;
}
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |