#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200009;
const long long MOD = 119 << 23 | 1;
class {
 public:
  int n;
  string s;
  int cnt[MAXN], Lz[MAXN], Rz[MAXN];
  long long H[MAXN], deg[MAXN], base = 2431;
  void init() {
    int curcnt = 0, one = 0;
    long long curh = 0;
    deg[0] = 1;
    for (int i = 1; i <= n; ++i) deg[i] = (deg[i - 1] * base) % MOD;
    for (int i = 0; i < n; ++i) {
      if (s[i] == '1') {
        one++;
      } else {
        one = 0;
      }
      curcnt++;
      if (one == 2) {
        one = 0;
        curcnt -= 2;
        curh = H[i - 2];
      } else {
        curh = (curh * base + (s[i] - '0')) % MOD;
      }
      H[i] = curh;
      cnt[i] = curcnt;
    }
    int a = -1;
    for (int i = 0; i < n; ++i) {
      if (s[i] == '0') {
        a = i;
      }
      Lz[i] = a;
    }
    a = n;
    for (int i = n - 1; i >= 0; --i) {
      if (s[i] == '0') {
        a = i;
      }
      Rz[i] = a;
    }
  }
  pair<long long, long long> cal(int l, int r) {
    pair<long long, long long> res = {0, 0};
    if (Rz[l] > r) {
      if ((r - l + 1) & 1) res = {1, 1};
      return res;
    }
    long long A = (Rz[l] - l) % 2, B = (r - Lz[r]) % 2;
    l = Rz[l];
    r = Lz[r];
    if (l == 0) {
      res.second = cnt[r] + A + B;
      res.first = H[r];
      if (A) res.first += deg[cnt[r]];
      res.first = (res.first % MOD + MOD) % MOD;
      if (B) res.first = res.first * 131 + 1;
    } else {
      res.first = H[r] - H[l - 1] * deg[cnt[r] - cnt[l - 1]];
      res.first = (res.first % MOD + MOD) % MOD;
      res.second = cnt[r] - cnt[l - 1] + A + B;
      if (A) res.first += deg[cnt[r] - cnt[l - 1]];
      res.first = (res.first % MOD + MOD) % MOD;
      if (B) res.first = res.first * 131 + 1;
    }
    res.first = (res.first % MOD + MOD) % MOD;
    return res;
  }
  void solve() {
    cin >> n >> s;
    init();
    int q;
    cin >> q;
    while (q--) {
      int l1, l2, len, r1, r2;
      cin >> l1 >> l2 >> len;
      --l1;
      --l2;
      r1 = len + l1 - 1;
      r2 = len + l2 - 1;
      if (cal(l1, r1) == cal(l2, r2)) {
        cout << "Yes\n";
      } else {
        cout << "No\n";
      }
    }
  }
} NSPACE;
int main() {
  ;
  ios_base::sync_with_stdio(false);
  cout.tie(0);
  cin.tie(0);
  NSPACE.solve();
}
