#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128;
#define x first 
#define y second
constexpr i64 mod = 1000000000000001729;
constexpr i64 P = 1000000613;
void solve() { 
    int n;
    cin >> n;
    vector<int> a(n + 1);
    auto get = [&](string s) -> int {
        int base = 1;
        int res = 0;
        for (int i = s.size() - 1; i >= 0; i--) {
            int x = 0;
            if (s[i] >= '0' && s[i] <= '9') x = s[i] - '0';
            else if (s[i] >= 'a' && s[i] <= 'z') {
                x = 10 + s[i] - 'a';
            }
            else {
                x = 36 + s[i] - 'A';
            }
            res += x * base;
            base *= 62;
        }
        return res;
    };
    for (int i = 1; i <= n; i++) {
        string s;
        cin >> s;
        int x = get(s);
        a[i] = x;
    }
    vector<i64> ha(n + 1), pw(n + 1);
    pw[0] = 1;
    for (int i = 1; i <= n; i++) {
        ha[i] = ((i128)ha[i - 1] * P % mod + a[i]) % mod;
        pw[i] = (i128)pw[i - 1] * P % mod;
    }

    auto query = [&](int l, int len) -> i64 {
        return ((i128)ha[l + len - 1] - (i128)ha[l - 1] * pw[len] % mod) % mod; 
    };

    vector<int> qy;
    for (int i = n; i >= 1; i--) qy.push_back(i);
    vector<bool> ans(n + 1);
    auto check = [&](int r, int k) -> bool {
        int len = r - 2 * k;
        if ((query(1, len) + query(1 + 2 * k, len)) % mod == (2 * query(k + 1, len) % mod)) {
            return true;
        }
        return false;
    };
    for (int k = 1; k <= n; k++) {
        while (!qy.empty() && qy.back() - 2 * k < 1) {
            qy.pop_back();
        }
        while (!qy.empty() && check(qy.back(), k)) {
            ans[qy.back()] = true;
            qy.pop_back();
        }
    }
    for (int i = 1; i <= n; i++) cout << ans[i];
    cout << '\n';
}
int main() { 
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}