#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200000 + 10;
const int MAXM = 500 + 10;
const int MOD = 1e8;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-9;
const double PI = 3.14159265358979;
int n;
char a[MAXN];
void solve() {
  scanf("%s", a);
  queue<int> s;
  int last = 1;
  for (int i = 0; i < n; i++) {
    if (a[i] == ')') {
      printf("%d", s.front());
      s.pop();
    } else {
      printf("%d", !last);
      s.push(!last);
      last = !last;
    }
  }
  printf("\n");
}
int main() {
  while (~scanf("%d%d", &n)) {
    solve();
  }
  return 0;
}
