#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  char c = getchar();
  long long x = 0;
  bool f = 0;
  for (; !isdigit(c); c = getchar()) f ^= !(c ^ 45);
  for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
  if (f) x = -x;
  return x;
}
struct modint {
  long long x;
  modint(long long o = 0) { x = o; }
  modint &operator=(long long o) { return x = o, *this; }
  modint &operator+=(modint o) {
    return x = x + o.x >= 1062127643 ? x + o.x - 1062127643 : x + o.x, *this;
  }
  modint &operator-=(modint o) {
    return x = x - o.x < 0 ? x - o.x + 1062127643 : x - o.x, *this;
  }
  modint &operator*=(modint o) { return x = 1ll * x * o.x % 1062127643, *this; }
  modint &operator^=(long long b) {
    modint a = *this, c = 1;
    for (; b; b >>= 1, a *= a)
      if (b & 1) c *= a;
    return x = c.x, *this;
  }
  modint &operator/=(modint o) { return *this *= o ^= 1062127643 - 2; }
  modint &operator+=(long long o) {
    return x = x + o >= 1062127643 ? x + o - 1062127643 : x + o, *this;
  }
  modint &operator-=(long long o) {
    return x = x - o < 0 ? x - o + 1062127643 : x - o, *this;
  }
  modint &operator*=(long long o) {
    return x = 1ll * x * o % 1062127643, *this;
  }
  modint &operator/=(long long o) {
    return *this *= ((modint(o)) ^= 1062127643 - 2);
  }
  template <class I>
  friend modint operator+(modint a, I b) {
    return a += b;
  }
  template <class I>
  friend modint operator-(modint a, I b) {
    return a -= b;
  }
  template <class I>
  friend modint operator*(modint a, I b) {
    return a *= b;
  }
  template <class I>
  friend modint operator/(modint a, I b) {
    return a /= b;
  }
  friend modint operator^(modint a, long long b) { return a ^= b; }
  friend bool operator==(modint a, long long b) { return a.x == b; }
  friend bool operator!=(modint a, long long b) { return a.x != b; }
  bool operator!() { return !x; }
  modint operator-() { return x ? 1062127643 - x : 0; }
};
modint pw[200005], val[200005], iv[200005], sum[200005], base = 19260817,
                                                         ivb = modint(1) / base;
modint odd = 97, even = 19491001;
long long n, m, a[200005];
char s[200005];
signed main() {
  pw[0] = 1;
  for (register long long i = (1); i <= (200000); ++i)
    pw[i] = pw[i - 1] * base, iv[i] = iv[i - 1] * ivb,
    sum[i] = sum[i - 1] + pw[i] * (odd + even);
  n = read();
  scanf("%s", s + 1);
  long long now = 0;
  for (register long long i = (1); i <= (n); ++i) {
    a[i] = a[i - 1];
    val[i] = val[i - 1];
    if (s[i] == '1') continue;
    a[i]++;
    if (i & 1)
      val[i] += pw[a[i]] * odd;
    else
      val[i] += pw[a[i]] * even;
  }
  m = read();
  while (m--) {
    long long l1 = read(), l2 = read(), len = read(), r1 = l1 + len - 1,
              r2 = l2 + len - 1;
    if (l1 > l2) swap(l1, l2), swap(r1, r2);
    modint v1 = val[r1] - val[l1 - 1];
    modint v2 = val[r2] - val[l2 - 1];
    if (a[r1] - a[l1 - 1] != a[r2] - a[l2 - 1]) {
      puts("No");
      continue;
    }
    long long dt = a[r2] - a[r1];
    v1 *= pw[dt];
    if ((l2 - l1) % 2 == 0) {
      puts(v1.x == v2.x ? "Yes" : "No");
    } else {
      modint qwq = sum[a[r2]] - sum[a[l2 - 1]];
      puts((v1 + v2).x == qwq.x ? "Yes" : "No");
    }
  }
  return 0;
}
