#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e6+5,M=N*10+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,m,k,A[N],f[N],flag[N];
int getid(char c){
	if(c>='0'&&c<='9') return c-'0';
	if(c>='a'&&c<='z') return c-'a'+10;
	if(c>='A'&&c<='Z') return c-'A'+36;
	return -1;
}
void Solve(){
	int i,j;scanf("%d",&n);
	for(i=1;i<=n;i++){
		char c=Gc();
		while(getid(c)==-1) c=Gc();
		while(~getid(c)) A[i]=A[i]*62+getid(c),c=Gc();
	}
	for(i=1;i*2+1<=n;i++){
		while(f[i]+1+2*i<=n&&A[f[i]+1]+A[f[i]+2*i+1]==2*A[f[i]+i+1]) f[i]++;
		flag[2*i+1]++;flag[2*i+1+f[i]]--;
		for(j=2*i;j<=n;j+=i) f[j]=max(f[j],f[i]+2*i-2*j);
	}
	for(i=1;i<=n;i++) flag[i]+=flag[i-1],putchar((flag[i]>0)?'1':'0');
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}