#include <bits/stdc++.h>

#define int int64_t

using u64 = uint64_t;

const int kMaxN = 2e6 + 5;
const u64 kBase1 = 13331, kBase2 = 12347, kBase3 = 1333331;

int n;
int a[kMaxN], cnt[kMaxN];
u64 hs1[kMaxN], hs2[kMaxN], hs3[kMaxN], pw1[kMaxN], pw2[kMaxN], pw3[kMaxN];

u64 gethash1(int l, int r) { return hs1[r] - hs1[l - 1] * pw1[r - l + 1]; }
u64 gethash2(int l, int r) { return hs2[r] - hs2[l - 1] * pw2[r - l + 1]; }
u64 gethash3(int l, int r) { return hs3[r] - hs3[l - 1] * pw3[r - l + 1]; }

void prework() {
  pw1[0] = pw2[0] = pw3[0] = 1;
  for (int i = 1; i <= n; ++i) {
    pw1[i] = kBase1 * pw1[i - 1];
    pw2[i] = kBase2 * pw2[i - 1];
    pw3[i] = kBase3 * pw3[i - 1];
    hs1[i] = kBase1 * hs1[i - 1] + a[i];
    hs2[i] = kBase2 * hs2[i - 1] + a[i];
    hs3[i] = kBase3 * hs3[i - 1] + a[i];
  }
}

void dickdreamer() {
  std::cin >> n;
  for (int i = 1; i <= n; ++i) {
    std::string str;
    std::cin >> str;
    for (auto c : str) {
      if (c >= '0' && c <= '9')
        a[i] = 62 * a[i] + c - '0';
      else if (c >= 'a' && c <= 'z')
        a[i] = 62 * a[i] + c - 'a' + 10;
      else
        a[i] = 62 * a[i] + c - 'A' + 36;
    }
  }
  prework();
  for (int i = 1; i <= (n - 1) / 2; ++i) {
    for (int j = 2 * i + 1; j <= n; j += i) {
      if (j + i - 1 <= n &&
          gethash1(j, j + i - 1) + gethash1(j - 2 * i, j - i - 1) ==
              2ull * gethash1(j - i, j - 1) &&
          gethash2(j, j + i - 1) + gethash2(j - 2 * i, j - i - 1) ==
              2ull * gethash2(j - i, j - 1) &&
          gethash3(j, j + i - 1) + gethash3(j - 2 * i, j - i - 1) ==
              2ull * gethash3(j - i, j - 1)) {
        ++cnt[j], --cnt[j + i];
      } else {
        int L = j - 1, R = std::min(j + i - 1, n) + 1, res = j - 1;
        while (L + 1 < R) {
          int mid = (L + R) >> 1;
          if (gethash1(j, mid) + gethash1(j - 2 * i, mid - 2 * i) ==
                  2ull * gethash1(j - i, mid - i) &&
              gethash2(j, mid) + gethash2(j - 2 * i, mid - 2 * i) ==
                  2ull * gethash2(j - i, mid - i) &&
              gethash3(j, mid) + gethash3(j - 2 * i, mid - 2 * i) ==
                  2ull * gethash3(j - i, mid - i))
            L = res = mid;
          else
            R = mid;
        }
        ++cnt[j], --cnt[res + 1];
      }
    }
  }
  for (int i = 1; i <= n; ++i) {
    cnt[i] += cnt[i - 1];
    std::cout << (bool)cnt[i];
  }
}

int32_t main() {
#ifdef ORZXKR
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
  int T = 1;
  // std::cin >> T;
  while (T--) dickdreamer();
  // std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
  return 0;
}