#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,t) for(int i=(s),_t=(t); i<=_t; ++i)
typedef __int128 ll;
const ll Mod=(1ll<<61)-1;
const int base=233;
const int N=2e6+50;
ll s[N],h[N];
ll qry(int l,int r) {
    return (s[r]-s[l-1]*h[r-l+1])%Mod;
}
bool check(int l,int k,int d) {
    return (qry(l-k-k,l-k-k+d-1)+qry(l,l+d-1)-qry(l-k,l-k+d-1)*2)%Mod==0;
}
int a[N];
int ans[N];
int val(char c) {
    if(isdigit(c)) return c-'0';
    else if(c>='a' && c<='z') return c-'a'+10;
    else return c-'A'+36;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    FOR(i,1,n) {
        string s;
        cin >> s;
        for(auto c: s) a[i]=a[i]*62+val(c);
    }
    h[0]=1;
    FOR(i,1,n) h[i]=h[i-1]*base%Mod;
    FOR(i,1,n) s[i]=(s[i-1]*base+a[i])%Mod;
    FOR(k,1,(n-1)/2) {
        int m=n/k;
        int c=2;
        FOR(i,3,m) {
            if(check((i-1)*k+1,k,k)) {
                c=i;
            } else {
                break;
            }
        }
        int L=1,R=min(n-c*k,k),d=0;
        while(L<=R) {
            int mid=L+R>>1;
            if(check(c*k+1,k,mid)) {
                d=mid;
                L=mid+1;
            } else R=mid-1;
        }
        ans[2*k+1]++;
        ans[c*k+d+1]--;
    }
    FOR(i,1,n) {
        ans[i]+=ans[i-1];
        cout << (ans[i]>0);
    }
    cout << '\n';
    return 0;
}