#include <bits/stdc++.h>
#define ms(x, v) memset(x, v, sizeof(x))
#define il __attribute__((always_inline)) static
#define U(i,l,r) for(int i(l),END##i(r);i<=END##i;++i)
#define D(i,r,l) for(int i(r),END##i(l);i>=END##i;--i)
using namespace std;
using ll = long long;

#define IC isdigit(c)
#define GC c=getchar()
void rd(auto &x) { x = 0; char GC; bool f = 0;
	for (; !IC; GC) f |= c == '-';
	for (; IC; GC) x = x * 10 + c - 48;
	if (f) x = -x;
}
void rd(auto &x, auto &...y) { rd(x); rd(y...); }
#define meow(...) fprintf(stderr, __VA_ARGS__)
#define Assert(e) if (!(e)) { meow("AF@%d\n", __LINE__); exit(__LINE__); }

// 等差数列的第二类定义
// a1 + a3 = 2a2
const int N = 2000006; const ll P = 998244353, BASE = P - 3;
int n, a[N]; ll hsh[N] {}, pb[N] {};
ll query(int l, int r) {
	return (hsh[r] - hsh[l - 1] * pb[r - l + 1] % P + P) % P;
}
int main() {
	pb[0] = 1; U (i, 1, N - 1) pb[i] = pb[i - 1] * BASE % P;
	// freopen("arrebol.in", "r", stdin);
	// freopen("arrebol.out", "w", stdout);

	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n;
	U (t, 1, n) {
		char s[32] {};
		cin >> s+1;
        int len = strlen(s+1);
        for(int i=1,now;i<=len;i++){
            if('0'<=s[i] && s[i]<='9') now = s[i]-'0';
            else if('a'<=s[i] && s[i]<='z') now = 10+s[i]-'a';
            else now = 36+s[i]-'A';
            a[t] = a[t]*62+now;
        }
		hsh[t] = (hsh[t - 1] * BASE + a[t]) % P;
	}
	int ans = 0;
	for (int i = 1, k = 1; i <= n; ++i) {
		while (1) { // check k;
			if (k * 2 + 1 > i) break;
			int l = i - (k * 2 + 1) + 1;
			ll h1 = query(1, l),
				h2 = query(k + 1, k + l),
				h3 = query(k * 2 + 1, k * 2 + l);
			if ((h1 + h3) % P == h2 * 2 % P)
				break;
			++k;
		}
		printf("%d", int(k <= (i - 1) / 2));
	}
}