#include <bits/stdc++.h>
using namespace std;
vector<string> vec_splitter(string s) {
  for (char& c : s) c = c == ',' ? ' ' : c;
  stringstream ss;
  ss << s;
  vector<string> res;
  for (string z; ss >> z; res.push_back(z))
    ;
  return res;
}
void debug_out(vector<string> args, int idx) { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, Head H, Tail... T) {
  if (idx > 0) cerr << ", ";
  stringstream ss;
  ss << H;
  cerr << args[idx] << " = " << ss.str();
  debug_out(args, idx + 1, T...);
}
void localTest() {}
const long long N = 2e5 + 5, M1 = 1e9 + 7, M2 = 1e9 + 9, P1 = 31, P2 = 43;
long long po[N][2], pre[N], nxt[N];
pair<pair<long long, long long>, long long> dp[N];
string s;
pair<pair<long long, long long>, long long> add(
    pair<pair<long long, long long>, long long> X, long long val) {
  X.first.first = (X.first.first * P1 + val) % M1;
  X.first.second = (X.first.second * P2 + val) % M2;
  X.second++;
  return X;
}
pair<pair<long long, long long>, long long> sub(
    pair<pair<long long, long long>, long long> X,
    pair<pair<long long, long long>, long long> Y) {
  long long pwr = X.second - Y.second;
  X.first.first = (X.first.first - (Y.first.first * po[pwr][0]) % M1 + M1) % M1;
  X.first.second =
      (X.first.second - (Y.first.second * po[pwr][1]) % M2 + M2) % M2;
  X.second = pwr;
  return X;
}
pair<pair<long long, long long>, long long> getHash(long long x, long long y) {
  if (pre[y] >= x) {
    auto ret = dp[x];
    long long val = 0;
    if (s[x - 1] == '1' && ((nxt[x] - x) % 2)) val = 1;
    ret = add(ret, val);
    ret = sub(ret, dp[pre[y]]);
    return ret;
  }
  return {{0LL, 0LL}, 0LL};
}
int main() {
  localTest();
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n >> s;
  po[0][0] = po[0][1] = 1;
  for (long long i = 1; i < N; ++i) {
    po[i][0] = (po[i - 1][0] * P1) % M1;
    po[i][1] = (po[i - 1][1] * P2) % M2;
  }
  nxt[n + 1] = n + 1;
  for (long long i = 1; i <= n; ++i) {
    if (s[i - 1] == '0')
      pre[i] = i;
    else
      pre[i] = pre[i - 1];
  }
  long long val = 0;
  dp[n + 1] = {{0LL, 0LL}, 0LL};
  for (long long i = n; i >= 1; --i) {
    if (s[i - 1] == '0') {
      dp[i] = add(dp[i + 1], val);
      nxt[i] = i;
      val = 0;
    } else {
      dp[i] = dp[i + 1];
      nxt[i] = nxt[i + 1];
      val ^= 1LL;
    }
  }
  long long q;
  cin >> q;
  while (q--) {
    long long x, y, z;
    cin >> x >> y >> z;
    if (getHash(x, x + z - 1) == getHash(y, y + z - 1))
      cout << "Yes\n";
    else
      cout << "No\n";
  }
  return 0;
}
