#include <bits/stdc++.h>
#define FileIO_(file) \
    freopen (file ".in", "r", stdin); \
    freopen (file ".out", "w", stdout);

using namespace std;

template<typename Tp>
inline void chmin (Tp &x, const Tp &y) { if (y < x) x = y; }
template<typename Tp>
inline void chmax (Tp &x, const Tp &y) { if (x < y) x = y; }

inline int toint (char c) {
    return
        islower (c) ? c - 'a' + 10 :
        isupper (c) ? c - 'A' + 36 : (c & 15);
}

template<typename Tp>
inline void read (Tp &x) {
    int c = getchar (); x = 0;
    while (!isgraph (c)) c = getchar ();
    do x = (x << 6) - (x << 1) + toint (c);
    while (isgraph (c = getchar ()));
}

typedef double dbl;
typedef long long ll;
typedef long double ldb;

void init () {}

const int maxn = 2e6 + 20;
const ll bx = 131;
const ll mod = 19260817;
int n, cnt[maxn];
ll px[maxn], hx[maxn];

ll pmod (ll x) {
    return x + (x >> 63 & mod);
}

ll getx (int p, int l) {
    return pmod (hx[p + l] - hx[p] * px[l] % mod);
}

bool check (int l, int k) {
    int len = l - 2 * k;
    return (getx (k, len) << 1) ==
        getx (0, len) + getx (k << 1, len);
}

void solve () {
    scanf ("%d", &n); px[0] = 1;

    for (int i = 1, a; i <= n; ++i) {
        read (a);
        px[i] = px[i - 1] * bx % mod;
        hx[i] = (hx[i - 1] * bx + a) % mod;
    }

    for (int k = 1, lo, hi, mid;
        (lo = k << 1 | 1) <= n; ++k) {
        ++cnt[lo]; hi = n + 1;
        while (lo < hi)
            if (check (mid = (lo + hi) >> 1, k))
                lo = mid + 1; else hi = mid;
        --cnt[lo];
    }

    for (int i = 1; i <= n; ++i)
        putchar ((cnt[i] += cnt[i - 1]) ? '1' : '0');
}

int main () {
//	#ifndef LSY
//	FileIO_("");
//	#endif
    int t = 1; init ();
//	scanf ("%d", &t);
    while (t--) solve ();
    return 0;
}