#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class t, class u>
void chmax(t& first, u second) {
  if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
  if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vc<vc<t>>;
using pi = pair<ll, ll>;
using vi = vc<ll>;
template <class t, class u>
ostream& operator<<(ostream& os, const pair<t, u>& p) {
  return os << "{" << p.first << "," << p.second << "}";
}
template <class t>
ostream& operator<<(ostream& os, const vc<t>& v) {
  os << "{";
  for (auto e : v) os << e << ",";
  return os << "}";
}
using uint = unsigned;
using ull = unsigned long long;
template <class t, size_t n>
ostream& operator<<(ostream& os, const array<t, n>& first) {
  return os << vc<t>(first.begin(), first.end());
}
template <ll i, class T>
void print_tuple(ostream&, const T&) {}
template <ll i, class T, class H, class... Args>
void print_tuple(ostream& os, const T& t) {
  if (i) os << ",";
  os << get<i>(t);
  print_tuple<i + 1, T, Args...>(os, t);
}
template <class... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
  os << "{";
  print_tuple<0, tuple<Args...>, Args...>(os, t);
  return os << "}";
}
template <class t>
void print(t x, ll suc = 1) {
  cout << x;
  if (suc == 1) cout << "\n";
  if (suc == 2) cout << " ";
}
ll read() {
  ll i;
  cin >> i;
  return i;
}
vi readvi(ll n, ll off = 0) {
  vi v(n);
  for (ll i = ll(0); i < ll(n); i++) v[i] = read() + off;
  return v;
}
template <class T>
void print(const vector<T>& v, ll suc = 1) {
  for (ll i = ll(0); i < ll(v.size()); i++)
    print(v[i], i == ll(v.size()) - 1 ? suc : 2);
}
string readString() {
  string s;
  cin >> s;
  return s;
}
template <class T>
T sq(const T& t) {
  return t * t;
}
void yes(bool ex = true) {
  cout << "Yes"
       << "\n";
  if (ex) exit(0);
}
void no(bool ex = true) {
  cout << "No"
       << "\n";
  if (ex) exit(0);
}
void possible(bool ex = true) {
  cout << "Possible"
       << "\n";
  if (ex) exit(0);
}
void impossible(bool ex = true) {
  cout << "Impossible"
       << "\n";
  if (ex) exit(0);
}
constexpr ll ten(ll n) { return n == 0 ? 1 : ten(n - 1) * 10; }
const ll infLL = LLONG_MAX / 3;
const ll inf = infLL;
ll topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
ll topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
ll botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); }
ll botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); }
ll popcount(signed t) { return __builtin_popcount(t); }
ll popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(ll i) { return i && (i & -i) == i; }
ll mask(ll i) { return (ll(1) << i) - 1; }
bool inc(ll first, ll second, ll c) { return first <= second && second <= c; }
template <class t>
void mkuni(vc<t>& v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
ll rand_int(ll l, ll r) {
  static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
  return uniform_int_distribution<ll>(l, r)(gen);
}
template <class t>
void myshuffle(vc<t>& first) {
  for (ll i = ll(0); i < ll(ll(first.size())); i++)
    swap(first[i], first[rand_int(0, i)]);
}
template <class t>
ll lwb(const vc<t>& v, const t& first) {
  return lower_bound(v.begin(), v.end(), first) - v.begin();
}
bool canmake(ll l, ll r, ll tar) {
  if (tar < 0) return false;
  if (tar == 0) return true;
  ll lw = 0, up = r - l + 1;
  while (up - lw > 1) {
    const ll mid = (lw + up) / 2;
    ll v = (r - mid + r - 1) * mid / 2;
    if (v >= tar)
      up = mid;
    else
      lw = mid;
  }
  if (up == r - l + 1) return false;
  ll v = (l + l + up - 1) * up / 2;
  return v <= tar;
}
vi restore(ll l, ll r, ll tar) {
  if (tar < 0) assert(0);
  if (tar == 0) return {};
  ll lw = 0, up = r - l + 1;
  while (up - lw > 1) {
    const ll mid = (lw + up) / 2;
    ll v = (r - mid + r - 1) * mid / 2;
    if (v >= tar)
      up = mid;
    else
      lw = mid;
  }
  if (up == r - l + 1) assert(0);
  ll v = (l + l + up - 1) * up / 2;
  assert(v <= tar);
  vi res(up);
  for (ll i = ll(0); i < ll(up); i++) res[i] = l + i;
  ll dif = tar - v;
  for (ll i = ll(up) - 1; i >= ll(0); i--) {
    ll u = min(r - up + i - res[i], dif);
    res[i] += u;
    dif -= u;
  }
  assert(dif == 0);
  return res;
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);
  ll n;
  cin >> n;
  vi t = readvi(n);
  t.push_back(0);
  reverse(t.begin(), t.end());
  n++;
  for (auto& v : t)
    if (v) v += n;
  t.push_back(n++);
  void(0);
  vi pre(n, -1);
  pre[n - 1] = -2;
  vi mx(n, -1);
  vi left(n);
  vc<tuple<ll, ll, ll>> buf(n);
  ll fix = n - 1;
  deque<ll> fr, bc;
  const ll B = 5;
  for (ll i = ll(n - 1) - 1; i >= ll(0); i--) {
    auto waf = [&](ll z, ll tar) {
      if (i == 1 && z == 5) {
        void(0);
        void(0);
      }
      if (pre[z] != -1) {
        ll ad = tar - t[z];
        if (canmake(left[z], z, ad)) {
          buf[i] = make_tuple(left[z], z, ad);
          pre[i] = z;
          return;
        }
      }
      if (mx[z] != -1) {
        ll ad = tar - (t[z] - 1);
        if (canmake(left[z], mx[z], ad)) {
          buf[i] = make_tuple(left[z], mx[z], ad);
          pre[i] = mx[z];
          return;
        }
      }
    };
    if (t[i]) {
      fr.push_front(fix);
      while (t[fr.front()] != t[fr.back()]) {
        bc.push_front(fr.back());
        fr.pop_back();
      }
      left[fix] = i + 1;
      fix = i;
      ll tar = t[i] - i;
      void(0);
      if (i < B) {
        bool ok = true;
        for (auto z : fr) {
          if (ok) waf(z, tar);
          if (t[z] != t[i] + 1) ok = false;
        }
        for (auto z : bc) {
          if (ok) waf(z, tar);
          if (t[z] != t[i] + 1) ok = false;
        }
      } else {
        if (t[fr[0]] == t[i] + 1) {
          if (ll(bc.size())) {
            waf(bc[0], tar);
          }
        } else {
          waf(fr[0], tar);
        }
      }
    } else if (ll(fr.size())) {
      ll tar = t[fix] - 1 - i;
      if (i < B) {
        bool ok = true;
        for (auto z : fr) {
          if (ok) waf(z, tar);
          if (t[z] != t[fix]) ok = false;
        }
        for (auto z : bc) {
          if (ok) waf(z, tar);
          if (t[z] != t[fix]) ok = false;
        }
      } else {
        if (t[fr[0]] == t[fix]) {
          if (ll(bc.size())) {
            waf(bc[0], tar);
          }
        } else {
          waf(fr[0], tar);
        }
      }
      if (pre[i] != -1 && mx[fix] == -1) mx[fix] = i;
    }
  }
  void(0);
  void(0);
  vi res(n);
  ll cur;
  for (ll i = ll(0); i < ll(n); i++)
    if (pre[i] != -1) {
      cur = i;
      break;
    }
  while (1) {
    res[cur] = 1;
    if (pre[cur] == -2) break;
    ll l, r, ad;
    tie(l, r, ad) = buf[cur];
    vi idx = restore(l, r, ad);
    for (auto i : idx) res[i] = 1;
    cur = pre[cur];
  }
  void(0);
  for (ll i = ll(n - 1) - 1; i >= ll(1); i--) print(res[i], 0);
  cout << endl;
}
