#include <bits/stdc++.h>
using namespace std;
namespace mine {
long long qread() {
  long long ans = 0, f = 1;
  char c = getchar();
  while (c < '0' or c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while ('0' <= c and c <= '9') ans = ans * 10 + c - '0', c = getchar();
  return ans * f;
}
void write(long long num) {
  if (num < 0) putchar('-'), num = -num;
  if (num >= 10) write(num / 10);
  putchar('0' + num % 10);
}
void write1(long long num) {
  write(num);
  putchar(' ');
}
void write2(long long num) {
  write(num);
  putchar('\n');
}
template <typename T>
inline bool chmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline bool chmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
bool IN(long long x, long long l, long long r) { return l <= x and x <= r; }
void GG() {
  puts("No");
  exit(0);
}
const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int mm(const int x) { return x >= MOD ? x - MOD : x; }
template <typename T>
void add(T &x, const int &y) {
  x = (x + y >= MOD ? x + y - MOD : x + y);
}
long long qpower(long long x, long long e, int mod = MOD) {
  long long ans = 1;
  while (e) {
    if (e & 1) ans = ans * x % mod;
    x = x * x % mod;
    e >>= 1;
  }
  return ans;
}
long long invm(long long x) { return qpower(x, MOD - 2); }
const int M = 5e6 + 10;
long long fac[M], facinv[M], Inv[M];
long long C(int n, int m) {
  return n < 0 or n < m ? 0 : fac[n] * facinv[m] % MOD * facinv[n - m] % MOD;
}
void PRE() {
  fac[0] = 1;
  for (int i = (1), I = (M - 1); i <= I; i++) fac[i] = fac[i - 1] * i % MOD;
  facinv[M - 1] = invm(fac[M - 1]);
  for (int i = (M - 1), I = (1); i >= I; i--)
    facinv[i - 1] = facinv[i] * i % MOD;
  Inv[1] = 1;
  for (int i = (2), I = (M - 1); i <= I; i++)
    Inv[i] = (MOD - MOD / i) * Inv[MOD % i] % MOD;
}
const int N = 1e6 + 10;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rd(long long l, long long r) { return l + rng() % (r - l + 1); }
namespace HASH {
long long base[2], mod[2], bs[2][N];
void prehash() {
  base[0] = 131;
  mod[0] = rd(1e7, 1e9);
  base[1] = 13331;
  mod[1] = 993244853;
  bs[0][0] = bs[1][0] = 1;
  for (int i = 1; i < N; i++)
    bs[0][i] = bs[0][i - 1] * base[0] % mod[0],
    bs[1][i] = bs[1][i - 1] * base[1] % mod[1];
}
pair<int, int> hash(pair<int, int> old, int add) {
  return {(old.first * base[0] + add) % mod[0],
          (old.second * base[1] + add) % mod[1]};
}
pair<int, int> gethash(pair<int, int> a[], int l, int r) {
  return {(a[r].first + mod[0] - a[l - 1].first * bs[0][r - l + 1] % mod[0]) %
              mod[0],
          (a[r].second + mod[1] - a[l - 1].second * bs[1][r - l + 1] % mod[1]) %
              mod[1]};
}
};  // namespace HASH
int h[N];
char str[N];
pair<int, int> hs[N];
void main() {
  int n = qread();
  scanf("%s", str + 1);
  HASH::prehash();
  int m = 0;
  for (int i = (1), I = (n); i <= I; i++)
    if (str[i] == '0') h[++m] = i;
  hs[1] = {0, 0};
  for (int i = (2), I = (m); i <= I; i++)
    hs[i] = HASH::hash(hs[i - 1], (h[i] - h[i - 1]) % 2);
  int q = qread();
  while (q--) {
    int l1 = qread(), l2 = qread(), len = qread();
    int al = lower_bound(h + 1, h + m + 1, l1) - h,
        ar = upper_bound(h + 1, h + m + 1, l1 + len - 1) - h - 1;
    int bl = lower_bound(h + 1, h + m + 1, l2) - h,
        br = upper_bound(h + 1, h + m + 1, l2 + len - 1) - h - 1;
    if (ar - al != br - bl) {
      puts("NO");
      continue;
    }
    if (al > ar) {
      puts("YES");
      continue;
    }
    if ((h[al] - l1) % 2 != (h[bl] - l2) % 2) {
      puts("NO");
      continue;
    }
    if (al == ar) {
      puts("YES");
      continue;
    }
    puts(HASH::gethash(hs, al + 1, ar) == HASH::gethash(hs, bl + 1, br) ? "yes"
                                                                        : "no");
  }
}
};  // namespace mine
signed main() {
  srand(time(0));
  mine::PRE();
  mine::main();
  printf("");
}
