#include<bits/stdc++.h>
using i64 = long long;
inline int tos(char x) {return x <= '9' ? (x - '0') : (x <= 'Z' ? (x + 36 - 'A') : (x + 10 - 'a'));}
inline int in() {
    std::string s; std::cin >> s;
    int sum = 0;
    for (char c : s) sum = sum * 62 + tos(c);
    return sum;
}
const int maxn = 4e6 + 10;
int a[maxn];
struct Hash {
    i64 P, mod;
    Hash(i64 P_, i64 mod_) {P = P_, mod = mod_;}
    i64 f[maxn], g[maxn];
    int k;
    inline void init(int n, int k_) {
        k = k_;
        for (int l = 1, r = k, i = 1; l <= n; l += k, r += k, i++) {
            i64 pw = 1;
            g[r + 1] = 0;
            for (int j = r; j >= l; j--) g[j] = (g[j + 1] + ((pw *= P) %= mod) * a[j]) % mod;
            f[i] = g[l];
        }
    }
    inline i64 sum(int x) {
        int b = (x - 1) / k + 1;
        return (f[b] - (x == b * k ? 0 : g[x + 1]) + mod) % mod;
    }
    inline bool check(int x) {
        int b = (x - 1) / k + 1, len = b * k - x;
        return (sum((b - 2) * k - len) + sum(x)) % mod == (sum((b - 1) * k - len) << 1) % mod;
    }
};
Hash H(998244353, 998244853);
int main() {
    std::ios::sync_with_stdio(false), std::cin.tie(0), std::cout.tie(0);
    int n; std::cin >> n;
    for (int i = 1; i <= n; i++) a[i] = in();
    int len = 1;
    auto check = [&](int i) {
        H.init(n, len);
        bool f = 1;
        for (int j = len * 3; j <= i; j += len) f &= H.check(j);
        f &= H.check(i);
        return f;
    };
    for (int i = 1; i <= n; i++) {
        if (len > (i - 1) / 2);
        else if (len == (i - 1) / 2) {
            if (! check(i)) len++;
        } else if (len < (i - 1) / 2 && ! H.check(i)) {
            while ((++len) <= (i - 1) / 2)
                if (check(len)) break;
        }
        std::cout << (len <= (i - 1) / 2);
    }
    return 0;
}