#include<bits/stdc++.h>
#define int long long
using namespace std;

int a[2000005],hash1[2000005],base1[2000005],hash2[2000005],base2[2000005],ans[2000005];
signed main() {
	int n;
	cin>>n;
	string s;
	for(int i=1;i<=n;i++) {
		cin>>s;
		for(int j=0;j<s.size();j++) {
			a[i]*=62;
			if(isdigit(s[j])) a[i]+=s[j]-'0';
			else if(s[j]>='a') a[i]+=s[j]-'a'+10;
			else a[i]+=s[j]-'A'+36;
		}
	}
	base1[0]=1;
	base2[0]=1;
	int mod1=998244353,mod2=993244853;
	for(int i=1;i<=n;i++) {
		base1[i]=base1[i-1]*97%mod1;
		base2[i]=base2[i-1]*101%mod2;
	}
	for(int i=1;i<=n;i++) {
		hash1[i]=(hash1[i-1]+base1[i-1]*a[i])%mod1;
		hash2[i]=(hash2[i-1]+base2[i-1]*a[i])%mod2;
	}
	int l,r,mid;
	for(int i=1;i<=(n-1)/2;i++) {
		l=i*2;
		r=n;
		while(l<r) {
			mid=(l+r+1)/2;
			if(((hash1[mid-2*i]*base1[2*i]%mod1+hash1[mid]-hash1[2*i]+mod1)%mod1)==((hash1[mid-i]-hash1[i])%mod1*base1[i]*2%mod1)  &&  (hash2[mid-2*i]*base2[2*i]%mod2+hash2[mid]-hash2[2*i]+mod2)%mod2==(hash2[mid-i]-hash2[i])%mod2*base2[i]*2%mod2) l=mid;
			else r=mid-1;
		}
		ans[2*i+1]++;
		ans[l+1]--;
	}
	for(int i=1;i<=n;i++) {
		ans[i]+=ans[i-1];
		if(ans[i]) cout<<1;
		else cout<<0;
	}
	return 0;
}