// Problem:  Balanced Array
// URL: https://vjudge.net/problem/QOJ-7877
// Writer: WRuperD
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int mininf = 1e9 + 7;
#define int long long
#define pb emplace_back
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
inline void write(int x){if(x<0){x=~(x-1);putchar('-');}if(x>9)write(x/10);putchar(x%10+'0');}
#define put() putchar(' ')
#define endl puts("")
#define ull unsigned long long
const int MAX = 2e6 + 10;

inline int fuckyouread(){
	char ch = getchar();
	while(!((ch >= '0' and ch <= '9') or (ch <= 'Z' and ch >= 'A') or (ch <= 'z' and ch >= 'a'))){
		ch = getchar();
	}
	int x = 0;
	while(((ch >= '0' and ch <= '9') or (ch <= 'Z' and ch >= 'A') or (ch <= 'z' and ch >= 'a'))){
		if(ch >= '0' and ch <= '9'){
			x = x * 62 + ch - '0';
		}else if(ch >= 'A' and ch <= 'Z'){
			x = x * 62 + ch - 'A' + 36; 
		}else{
			x = x * 62 + ch - 'a' + 10;
		}
		ch = getchar();
	}
	return x;
}

ull a[MAX];

ull base = 131;
ull hsh[MAX];
ull pre[MAX];
__int128 pre2[MAX], hsh2[MAX], base2 = 13331;
__int128 mod = 212370440130137957ll;

ull gethsh(int l, int r){
	return (hsh[r] - hsh[l - 1] * pre[r - l + 1]);
}

ull gethsh2(int l, int r){
	return (hsh2[r] - hsh2[l - 1] * pre2[r - l + 1] % mod + mod) % mod;
}
int mk[MAX];

void solve(){
	int n = read();
	for(int i = 1; i <= n; i++){
		a[i] = fuckyouread();
	}
	pre[0] = 1;
	for(int i = 1; i <= n; i++){
		pre[i] = pre[i - 1] * base;
	}
	pre2[0] = 1;
	for(int i = 1; i <= n; i++){
		pre2[i] = pre2[i - 1] * base2 % mod;
	}
	for(int i = 1; i <= n; i++){
		hsh[i] = hsh[i - 1] * base + a[i];
	}
	for(int i = 1; i <= n; i++){
		hsh2[i] = hsh2[i - 1] * base2 % mod + a[i];
		hsh2[i] %= mod; 
	}
	for(int i = 1; i <= n / 2 + 1; i++){
		int l = 2 * i + 1, r = n;
		int ans = l - 1;
		while(l <= r){
			int mid = (l + r) >> 1;
			if(gethsh(1, mid - 2 * i) + gethsh(2 * i + 1, mid) == (ull)(2) * gethsh(i + 1, mid - i) and (gethsh2(1, mid - 2 * i) + gethsh2(2 * i + 1, mid) % mod) == (2 * gethsh2(i + 1, mid - i))){
				l = mid + 1;
				ans = mid;
			}else{
				r = mid - 1;
			}
		}
		if(2 * i + 1 <= ans){
			mk[2 * i + 1]++, mk[ans + 1]--;
		}
	}
	int now = 0;
	for(int i = 1; i <= n; i++){
		now += mk[i];
		if(now){
			putchar('1');
		}else{
			putchar('0');
		}
	}
}

signed main(){
	int t = 1;
	while(t--)	solve();
	return 0;
}