#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long 
#define i128 __int128
using namespace std; 
const int mod = 1019260817, G = 19491001;
const int N = 2e6 + 7;
int n;
int a[N]; 
int pw[N];

int pre[N];
inline int Get(int l, int Len) {
	int r = l + Len - 1;
	return (pre[r] - (ll)pre[l - 1] * pw[r - l + 1] % mod) % mod;
} 

int ans[N];
int main() {
//	freopen("data.txt", "r", stdin);
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n; 
	L(i, 1, n) {
		string s;
		cin >> s;
		for(auto&u : s) {
			int w = 0;
			if('0' <= u && u <= '9') {
				w = u - '0';
			} else if('a' <= u && u <= 'z') {
				w = u - 'a' + 10;
			} else if('A' <= u && u <= 'Z') {
				w = u - 'A' + 36;
			}
			a[i] = a[i] * 62 + w;
		}
	}
	L(i, 1, n) {
		pre[i] = ((ll)pre[i - 1] * G + a[i]) % mod;
	}
	pw[0] = 1;
	L(i, 1, n) {
		pw[i] = (ll)pw[i - 1] * G % mod;
	}
	int mxp = 1;
	for(int k = 1; k <= n; ++k) {
		mxp = max(mxp, 2 * k + 1);
		if(mxp > n) continue;
		int len = mxp - 2 * k;
//		cout << Get(1, len) << ' ' << Get(1 + k * 2, len) << ' ' << Get(1 + k, len) << endl;
		if((Get(1, len) + Get(1 + k * 2, len)) % mod == (ll)2 * Get(1 + k, len) % mod) {
			while(a[mxp] + a[mxp - 2 * k] == a[mxp - k] * 2) {
				ans[mxp] = 1;
				++mxp;
			}	
		}
	}
	L(i, 1, n) 
		cout << ans[i];
	cout << '\n';
	return 0;
}