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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

struct Hash
{
    static constexpr int MOD=1e9+7;
    long long val;
    constexpr Hash(long long val=0):val(val%MOD){}
    friend constexpr Hash operator*(const Hash& l,const Hash& r)
    {
        return {l.val * r.val%MOD};
    }
    friend constexpr Hash operator+(const Hash& l,const Hash& r)
    {
        return {(l.val+r.val)%MOD};
    }
    friend constexpr Hash operator-(const Hash& l,const Hash& r)
    {
        return {(l.val-r.val)%MOD};
    }
    bool constexpr operator!() const
    {
        return !val;
    }
};

const int N=2e6+100;
constexpr Hash BASE=998244353;

Hash pw[N];
Hash a[N];
Hash h[N];

Hash get(int l,int r)
{
    Hash ret=h[r]-h[l]*pw[r-l];
//    cout<<"get("<<l<<","<<r<<")="<<h[r].val<<"-"<<h[l].val<<"*"<<pw[r-l].val<<"\n";
    return ret;
}

int ok[N];

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    pw[0]=1;
    for(int i=1;i<N;i++)
        pw[i]=pw[i-1]*BASE;

    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        string s;
        cin>>s;
        int x=0;
        for(char c:s)
        {
            x*=62;
            x+=(c<='9'?c-'0':c<='Z'?c-'A'+10+26:c-'a'+10);
        }
        a[i]=x;
    }
    h[0]=Hash();
    for(int i=1;i<=n;i++)
        h[i]=h[i-1]*BASE+a[i];
    for(int k=1;k<=(n-1)/2;k++)
    {
        int k2=(k<<1);
        int lo=k2,hi=n;
        while(lo<hi)
        {
            int mi=(lo+hi+1)>>1;
            Hash A=get(1,mi-k2);
            Hash B=get(1+k,mi-k);
            Hash C=get(1+k2,mi);
//            cout<<"k="<<k<<" mi="<<mi<<" -> "<<1<<".."<<mi-k2<<" "<<1+k<<".."<<mi-k<<" "<<1+k2<<".."<<mi<<" -> "<<!(A-B-B+C)<<"\n";
            if(!(A-B-B+C))
                lo=mi;
            else
                hi=mi-1;
        }
        ok[k2+1]++;
        ok[hi+1]--;
//        cout<<"k="<<k<<" -> "<<k2+1<<".."<<hi<<"\n";
    }
    for(int i=1;i<=n;i++) {
        ok[i] += ok[i - 1];
        cout<<bool(ok[i]);
    }
}