// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
// #define debug
const int MOD = 1000000007;
const int base = 998244353;
template <unsigned MOD>
struct mint
{
    unsigned v;
    mint(unsigned v_ = 0) : v(v_) {}
    mint operator-() const { return v ? MOD - v : *this; }
    mint &operator+=(const mint &X) { return (v += X.v) >= MOD ? v -= MOD : v, *this; }
    mint &operator-=(const mint &X) { return (v += MOD - X.v) >= MOD ? v -= MOD : v, *this; }
    mint &operator*=(const mint &X) { return v = 1llu * v * X.v % MOD, *this; }
    mint &operator/=(const mint &X) { return *this *= X.inv(); }
    mint pow(long long B) const
    {
        B %= MOD - 1;
        if (B < 0)
            B += MOD - 1;
        mint res = 1, A = *this;
        while (B)
        {
            if (B & 1)
                res *= A;
            B >>= 1;
            A *= A;
        }
        return res;
    }
    mint inv() const { return pow(MOD - 2); }
    friend mint operator+(const mint &A, const mint &B) { return mint(A) += B; }
    friend mint operator-(const mint &A, const mint &B) { return mint(A) -= B; }
    friend mint operator*(const mint &A, const mint &B) { return mint(A) *= B; }
    friend mint operator/(const mint &A, const mint &B) { return mint(A) /= B; }
    friend std::istream &operator>>(std::istream &A, mint &B) { return A >> B.v; }
    friend std::ostream &operator<<(std::ostream &A, const mint &B) { return A << B.v; }
    friend bool operator==(const mint &A, const mint &B) { return A.v == B.v; }
    explicit operator bool() const { return v; }
};
typedef mint<1000000007> mint1;
typedef mint<1000000009> mint2;
mint1 pre1[2000005], pw1[2000005];
mint2 pre2[2000005], pw2[2000005];
int n, a[2000005], b[2000005];
std::string s;
int trans(char c)
{
    if (isdigit(c))
        return c - '0';
    if (islower(c))
        return c - 'a' + 10;
    if (isupper(c))
        return c - 'A' + 36;
    return -1;
}
mint1 get1(int l, int r) { return pre1[r] - pre1[l] * pw1[r - l]; }
mint2 get2(int l, int r) { return pre2[r] - pre2[l] * pw2[r - l]; }
signed main()
{
    std::ios::sync_with_stdio(false);
    pw1[0] = 1;
    for (int i = 1; i <= 2000000; ++i)
        pw1[i] = pw1[i - 1] * base;
    pw2[0] = 1;
    for (int i = 1; i <= 2000000; ++i)
        pw2[i] = pw2[i - 1] * base;
    std::cin >> n;
    for (int i = 1; i <= n; ++i)
    {
        std::cin >> s;
        for (std::size_t j = 0; j != s.size(); ++j)
            a[i] = a[i] * 62 + trans(s[j]);
        b[i] = a[i] - a[i - 1];
        pre1[i] = pre1[i - 1] * base + b[i];
        pre2[i] = pre2[i - 1] * base + b[i];
    }
    for (int i = 1, j = 1; i <= n; ++i)
    {
        if (j > (i - 1) / 2)
            std::cout << 0;
        else if (a[i] + a[i - j * 2] == 2 * a[i - j])
            std::cout << 1;
        else
        {
            for (++j; j <= (i - 1) / 2; ++j)
                if (get1(1, i - j) == get1(1 + j, i) && get2(1, i - j) == get2(1 + j, i))
                    break;
            std::cout << (j <= (i - 1) / 2);
        }
    }
    return 0;
}