#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int v[300];

int henkan(string s){
	int f = 0;
	rep(i,0,(int)s.size()){
		f = f * 62 + v[s[i]];
	}
	return f;
}

int main(){
	
	{
		int piv = 0;
		rep(i,'0','9'+1){
			v[i] = piv;
			piv++;
		}
		rep(i,'a','z'+1){
			v[i] = piv;
			piv++;
		}
		rep(i,'A','Z'+1){
			v[i] = piv;
			piv++;
		}
	}

	int n; cin >> n;
	vector<int> a(n);
	rep(i,0,n){
		string s; cin >> s;
		a[i] = henkan(s);
	}

	int now = 1;
	int piv = 0;
	vector<bool> ans(n);
	rep(i,0,n){
		while(true){
			if (i-now*2 < 0){
				break;
			}
			bool mode = true;
			rrep(j, piv, i-now*2+1){
				if (a[j] - a[j + now] * 2 + a[j + now*2] != 0){
					mode = false;
					break;
				}
			}
			if (mode){
				piv = i-now*2;
				ans[i] = 1;
				break;
			}
			now++;
		}
	}

	rep(i,0,n){
		cout << ans[i];
	}
	cout << '\n';

	
}