# include <bits/stdc++.h>

using namespace std;

# define ull unsigned long long 

const int N = 2e6 + 5 , base = 2333;
int n , a[N] , ans[N];
ull ha[N] , pw[N*9];

int trans(string s)
{
    int res = 0;
    for(int i = 0; i < s.length(); i++)
    {
        if('0' <= s[i] && s[i] <= '9') res = res * 62 + s[i] - '0';
        if('a' <= s[i] && s[i] <= 'z') res = res * 62 + s[i] - 'a' + 10;
        if('A' <= s[i] && s[i] <= 'Z') res = res * 62 + s[i] - 'A' + 10 + 26;
    }
    return res;
}

void Add(int x , int k)
{
    ha[k] = ha[k - 1];
    for(int i = 8; ~i; i--)
    {
        int y = x / pow(10 , i);
        y %= 10;
        ha[k] = ha[k] * base + y;
    }
}

ull Ha(int l , int r)
{
    return ha[r] - ha[l - 1] * pw[(r - l + 1) * 9];
}

bool check(int k , int l)
{
    return Ha(1 , l - 2 * k) + Ha(2 * k + 1 , l) == 2 * Ha(k + 1 , l - k);
}

int main()
{
    cin >> n;
    pw[0] = 1;
    for(int i = 1; i <= 9 * n; i++) pw[i] = pw[i - 1] * base;
    for(int i = 1; i <= n; i++)
    {
        string s;
        cin >> s;
        a[i] = trans(s);
        Add(a[i] , i);
    }
    for(int i = 1 , j = 1; i <= (n - 1) / 2 && j <= n; i++)
    {
        while(i > (j - 1) / 2) j++;
        while(check(i , j)) ans[j] = 1 , j++;
    }
    for(int i = 1; i <= n; i++) cout << ans[i];
    return 0;
}