// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) {rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1];}

const int N = 2e6, bs = 137, mod = 998244353;
int a, s[N + 5], h[N + 5], pw[N + 5];

int get(string o) {
    int res = 0;
    static auto id = [&] (char x) {
        if(x >= '0' && x <= '9') return x - '0';
        else if(x >= 'a' && x <= 'z') return x - 'a' + 10;
        return x - 'A' + 36;
    };
    rep(i, 0, siz(o) - 1) res = res * 62 + id(o[i]);
    return res;
}
int H(int l, int r) {return (h[r] - h[l - 1] * pw[r - l + 1] % mod + mod) % mod;}

signed main() {
    // freopen(".in", "r", stdin);
    // freopen(".out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> a;
    string o;
    int tmp = 0;
    pw[0] = 1;
    rep(i, 1, a) {
        cin >> o;
        s[i] = get(o);
        h[i] = (h[i - 1] * bs + s[i]) % mod;
        pw[i] = pw[i - 1] * bs % mod;
    }
    rep(i, 1, a) {
        if(i > 1 && (i & 1)) {
            bool is = 1;
            if(tmp) is = H(i, i + tmp - 1) + H(1, tmp) == H((i + 1) / 2, (i + 1) / 2 + tmp - 1) * 2 % mod;
            if(is) while(i + tmp <= a && s[i + tmp] + s[1 + tmp] == s[(i + 1) / 2 + tmp] * 2) ++tmp;
        }
        if(tmp) cout << 1, --tmp;
        else cout << 0;
    }
    return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}