#include <bits/stdc++.h>
using namespace std;
using pii = pair<long long, long long>;
using vi = vector<long long>;
using vvi = vector<vi>;
const signed INF_ = 1001001001;
const long long INF = 1001001001001001001LL;
const long long DX[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0},
                DY[9] = {-1, 0, 1, 0, -1, 1, 1, -1, 0};
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++)
    os << *i << (i == end(v) - 1 ? "" : " ");
  return os;
}
template <class T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) is >> *i;
  return is;
}
template <class T, class U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}
template <class T, class U>
bool chmax(T &a, const U &b) {
  return a < b ? a = b, 1 : 0;
}
template <class T, class U>
bool chmin(T &a, const U &b) {
  return a > b ? a = b, 1 : 0;
}
template <class T>
void psum(T &c) {
  partial_sum(begin(c), end(c), begin(c));
}
template <class T>
using heap = priority_queue<T, vector<T>, greater<T>>;
struct before_main_function {
  before_main_function() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << setprecision(15) << fixed;
  }
} before_main_function;
signed main() {
  long long n;
  cin >> n;
  string s;
  cin >> s;
  long long cnt = 0;
  long long mx = 0;
  vector<long long> d(n, 0);
  stack<long long> st;
  for (long long i = 0, ilen = (long long)(n); i < ilen; ++i) {
    if (s[i] == '(') {
      cnt++;
      d[i] = cnt;
    } else if (s[i] == ')') {
      d[i] = cnt;
      cnt--;
    }
    chmax(mx, cnt);
  }
  long long L = mx / 2;
  vector<long long> ans(n);
  for (long long i = 0, ilen = (long long)(n); i < ilen; ++i) {
    if (d[i] <= L) {
      ans[i] = 0;
    } else {
      ans[i] = 1;
    }
  }
  for (long long x : ans) cout << x;
  cout << endl;
  return (0 ^ 0 ^ 0);
}
