#include <bits/stdc++.h>
struct MI {
 private:
  char bb[1 << 14];
  FILE *f;
  char *bs, *be;
  char e;
  bool o, l;

 public:
  MI() : f(stdin), bs(0), be(0) {}
  inline char get() {
    if (o) {
      o = 0;
      return e;
    }
    if (bs == be) be = (bs = bb) + fread(bb, 1, sizeof(bb), f);
    if (bs == be) {
      l = 1;
      return -1;
    };
    return *bs++;
  }
  inline void unget(char c) {
    o = 1;
    e = c;
  }
  template <class T>
  inline T read() {
    T r;
    *this > r;
    return r;
  }
  template <class T>
  inline MI &operator>(T &);
};
template <class T>
struct Q {
  const static bool U = T(-1) >= T(0);
  inline void operator()(MI &t, T &r) const {
    r = 0;
    char c;
    bool y = 0;
    if (U)
      for (;;) {
        c = t.get();
        if (c == -1) goto E;
        if (isdigit(c)) break;
      }
    else
      for (;;) {
        c = t.get();
        if (c == -1) goto E;
        if (c == '-') {
          c = t.get();
          if (isdigit(c)) {
            y = 1;
            break;
          };
        } else if (isdigit(c))
          break;
        ;
      };
    for (;;) {
      if (c == -1) goto E;
      if (isdigit(c))
        r = r * 10 + (c ^ 48);
      else
        break;
      c = t.get();
    }
    t.unget(c);
  E:;
    if (y) r = -r;
  }
};
template <>
struct Q<char> {
  inline void operator()(MI &t, char &r) {
    int c;
    for (;;) {
      c = t.get();
      if (c == -1) {
        r = -1;
        return;
      };
      if (!isspace(c)) {
        r = c;
        return;
      };
    }
  }
};
template <class T>
inline MI &MI::operator>(T &t) {
  Q<T>()(*this, t);
  return *this;
}
template <class T>
std::ostream &operator<(std::ostream &out, const T &t) {
  return out << t;
}
using std::cout;
MI cin;
const int $n = 200005;
const int mod = 1000000009;
inline int add(int x, int y) { return (x += y) >= mod ? x - mod : x; }
inline int sub(int x, int y) { return (x -= y) < 0 ? x + mod : x; }
int n, cnt[$n];
bool v[$n];
struct hash {
  unsigned long long h1;
  int h2;
  hash() {}
  hash(int t) : h1(t), h2(t) {}
  hash(unsigned long long h1, int h2) : h1(h1), h2(h2) {}
  inline hash operator+(const hash &t) const {
    return {h1 + t.h1, add(h2, t.h2)};
  }
  inline hash operator-(const hash &t) const {
    return {h1 - t.h1, sub(h2, t.h2)};
  }
  inline hash operator*(const hash &t) const {
    return {h1 * t.h1, (int)((long long)h2 * t.h2 % mod)};
  }
  inline bool operator==(const hash &t) const {
    return h1 == t.h1 && h2 == t.h2;
  }
};
const hash B = {31, 311};
hash ha[$n], pw[$n], wp[$n];
inline std::pair<int, hash> calc(int l, int r) {
  const auto zh = cnt[r] - cnt[l - 1];
  hash h = ha[r] - ha[l - 1] * pw[zh];
  if ((l - 1) & 1) h = wp[zh] - h;
  return {zh, h};
}
int main() {
  cin > n;
  cin.unget(cin.read<char>());
  for (int __r = (n), i = (1); i <= __r; ++i) v[i] = cin.get() - '0';
  pw[0] = {1, 1};
  for (int __r = (n), i = (1); i <= __r; ++i) {
    pw[i] = pw[i - 1] * B;
    wp[i] = wp[i - 1] + pw[i - 1];
  }
  for (int __r = (n), i = (1); i <= __r; ++i) {
    ha[i] = ha[i - 1];
    cnt[i] = cnt[i - 1];
    if (v[i]) continue;
    ha[i] = ha[i - 1] * B + hash(i & 1);
    ++cnt[i];
  }
  for (int __r = ((cin.read<int>())), _ = (1); _ <= __r; ++_) {
    const auto l1 = (cin.read<int>()), l2 = (cin.read<int>()),
               len = (cin.read<int>());
    cout <
        (calc(l1, l1 + len - 1) == calc(l2, l2 + len - 1) ? "Yes\n" : "No\n");
  }
}
