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

int read(){
	int f=0,s=0; char c=getchar();
	while(c>'9'||c<'0')f=(c=='-'),c=getchar();
	while(c>='0'&&c<='9')s=(s<<3)+(s<<1)+(c^'0'),c=getchar();
	return f?-s:s;
}
char tmp[35];
int readd(){
	scanf("%s",tmp+1);
	int len=strlen(tmp+1);
	int res=0;
	for(int i=1;i<=len;i++){
		res*=62;
		if(tmp[i]>='0'&&tmp[i]<='9')res+=tmp[i]-'0';
		else if(islower(tmp[i]))res+=(tmp[i]-'a')+10;
		else if(isupper(tmp[i]))res+=(tmp[i]-'A')+36;
	}
	return res;
}

const int N=2000005;
int n;
int a[N];
int b[N];

const ull bs=131;
ull pw[N];
ull hs[N];
ull get(int l,int r){
	if(l>r)return 0;
	return hs[r]-hs[l-1]*pw[r-l+1];
}
int now=1;

bool chk(int k,int len){
	int dt=len-(1+2*k)-1;
	if(a[1]+a[1+2*k]!=2*a[1+k])return 0;
	// cout<<" : "<<k<<' '<<len<<' '<<dt<<endl;
	ull t1=get(1,1+dt);
	ull t2=get(1+2*k,1+2*k+dt);
	ull t3=get(1+k,1+k+dt);
	return t1+t2==2*t3;
}
bool check(int len){
	while(1+2*now<=len&&!chk(now,len))now++;
	if(1+2*now>len)return 0;
	return 1;
}

int main(){
	n=read();
	for(int i=1;i<=n;i++){
		a[i]=readd();
		// cout<<a[i]<<' ';
	}
	for(int i=1;i<=n;i++)b[i]=a[i]-a[i+1];
	pw[0]=1; for(int i=1;i<N;i++)pw[i]=pw[i-1]*bs;
	hs[0]=0; for(int i=1;i<N;i++)hs[i]=hs[i-1]*bs+b[i];
	for(int i=1;i<=n;i++){
		if(check(i))putchar('1');
		else putchar('0');
	}
	return 0;
}