#include <bits/stdc++.h>
using namespace std;
inline int add(int x, int y) {
  if (x + y >= 998244353) return x + y - 998244353;
  return x + y;
}
inline int sub(int x, int y) {
  if (x - y < 0) return x - y + 998244353;
  return x - y;
}
inline int mul(int x, int y) { return 1LL * x * y % 998244353; }
int P = 71;
int inv = 702988981;
int n;
int pwr[200005], pref[200005], nxt0[200005], pre0[200005], dp[200005],
    lent[200005];
int get_hash(int l, int r) {
  if (pref[r] - pref[l - 1] == r - l + 1) {
    return (r - l + 1) % 2 == 0 ? 0 : 1;
  }
  int x = nxt0[l];
  int y = pre0[r];
  int L = lent[y] - lent[x] + 1;
  int val = sub(dp[y], mul(dp[x - 1], pwr[L]));
  if ((r - y) % 2) {
    val = add(mul(val, P), 1);
    ++L;
  }
  if ((x - l) % 2) {
    val = add(val, mul(pwr[L], 1));
  }
  return val;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  cin >> n;
  pwr[0] = 1;
  for (int i = 1; i < 200005; i++) {
    pwr[i] = mul(pwr[i - 1], P);
  }
  string s;
  cin >> s;
  s = '0' + s;
  for (int i = 1; i < n + 1; i++) {
    pref[i] = pref[i - 1] + (s[i] == '1');
    if (s[i] == '0') {
      pre0[i] = i;
    } else {
      pre0[i] = pre0[i - 1];
    }
    if (s[i] == '1') {
      if (s[i - 1] != '1') {
        dp[i] = add(mul(dp[i - 1], P), 1);
        lent[i] = lent[i - 1] + 1;
      } else {
        dp[i] = dp[i - 2];
        lent[i] = lent[i - 2];
      }
    } else {
      dp[i] = add(mul(dp[i - 1], P), 0);
      lent[i] = lent[i - 1] + 1;
    }
  }
  nxt0[n + 1] = n + 1;
  for (int i = n; i >= 1; --i) {
    if (s[i] == '0') {
      nxt0[i] = i;
    } else {
      nxt0[i] = nxt0[i + 1];
    }
  }
  int q;
  cin >> q;
  while (q--) {
    int l1, l2, len;
    cin >> l1 >> l2 >> len;
    int r1 = l1 + len - 1;
    int r2 = l2 + len - 1;
    int x = get_hash(l1, r1);
    int y = get_hash(l2, r2);
    if (pref[r1] - pref[l1 - 1] != pref[r2] - pref[l2 - 1]) {
      cout << "No" << '\n';
    } else if (x == y) {
      cout << "Yes" << '\n';
    } else {
      cout << "No" << '\n';
    }
  }
}
