#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n;
int cnt[N], sum[N], pre[N];
char s[N];
vector<int> pos, ss;
void init() {
  for (int i = (1); i < (n + 1); i++) {
    sum[i] = sum[i - 1] + s[i] - '0';
    if (s[i] == '0') pos.push_back(i);
  }
  int t = (int)pos.size() * 2 - 1;
  if ((int)pos.size()) ss.push_back(0);
  for (int i = 1; i < (int)pos.size(); ++i) {
    int d = pos[i] - pos[i - 1] - 1;
    if (d & 1)
      ss.push_back(1);
    else
      ss.push_back(0);
    ss.push_back(0);
  }
}
const int P = 1e9 + 7;
const int P1 = 998244353;
const int P2 = 1e6 + 3;
struct str {
  int B[N], h[N], ba;
  int mul(int a, int b) { return (long long)a * b % P; }
  str(int ba) {
    this->ba = ba;
    B[0] = 1;
    for (int i = (1); i < (N); i++) B[i] = mul(B[i - 1], ba);
  }
  int add(int a, int b) {
    if ((a += b) >= P) a -= P;
    return a < 0 ? a + P : a;
  }
  void init(vector<int> &s) {
    if ((int)s.size() == 0) return;
    h[0] = s[0] + 1;
    for (int i = (1); i < ((int)s.size()); i++)
      h[i] = add(mul(h[i - 1], ba), s[i] + 1);
  }
  int sub(int l, int r) {
    if (!l) return h[r];
    return add(h[r], -mul(h[l - 1], B[r - l + 1]));
  }
} ha(233);
int solve(int l, int r) {
  int x = lower_bound(pos.begin(), pos.end(), l) - pos.begin();
  int y = upper_bound(pos.begin(), pos.end(), r) - pos.begin();
  y--;
  int val = ha.sub(2 * x, 2 * y);
  if ((pos[x] - l) % 2 == 0)
    val = (long long)val * P2 % P;
  else
    val = (long long)val * P1 % P;
  return val;
}
int main() {
  cin >> n;
  cin >> (s + 1);
  init();
  ha.init(ss);
  int q;
  cin >> q;
  int l1, l2, len, r1, r2;
  while (q--) {
    cin >> l1 >> l2 >> len;
    r1 = l1 + len - 1, r2 = l2 + len - 1;
    if (sum[r1] - sum[l1 - 1] == sum[r2] - sum[l2 - 1]) {
      if (sum[r1] - sum[l1 - 1] == 0 || sum[r1] - sum[l1 - 1] == len)
        cout << "Yes\n";
      else {
        if (solve(l1, r1) == solve(l2, r2))
          cout << "Yes\n";
        else
          cout << "No\n";
      }
    } else
      cout << "No\n";
  }
  return 0;
}
