#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef int (*itoi)(int);
typedef int (*iitoi)(int, int);
typedef int (*iiitoi)(int, int, int);
typedef ll (*ltol)(ll);
typedef ll (*lltol)(ll, ll);
typedef ll (*llltol)(ll, ll, ll);
const long double PI = acos(0) * 2;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;
int X4[] = {-1, 0, 1, 0}, Y4[] = {0, -1, 0, 1};
int X8[] = {-1, -1, -1, 0, 1, 1, 1, 0}, Y8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
template <typename T>
inline bool uax(T& a, T b) {
  return a < b ? (a = b, 1) : 0;
}
template <typename T>
inline bool uin(T& a, T b) {
  return a > b ? (a = b, 1) : 0;
}
template <typename T1, typename T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << '(' << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i];
    if (i + 1 < (int)v.size()) os << ' ';
  }
  return os;
}
const ll MOD = 1e9 + 7;
const ll H1 = 100403, H2 = 142433, H3 = 185099;
const int MAX_N = 2e5 + 20;
int N;
char A[MAX_N];
ll H[MAX_N], U[MAX_N];
ll mod_inv(ll v) {
  ll x = 1, y = v, p = MOD - 2;
  while (p) {
    if (p & 1) x = (x * y) % MOD;
    p >>= 1;
    y = (y * y) % MOD;
  }
  return x;
}
ll Hval(int l, int r) {
  ll a = ((H[r] - U[r] + MOD) % MOD) *
         mod_inv((H[l - 1] - U[l - 1] + MOD) % MOD) % MOD;
  ll b = (H[r] - (a * H[l - 1]) % MOD + MOD) % MOD;
  return (a * 10000 + b) % MOD;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout << std::setprecision(10);
  cout << fixed;
  cin >> N;
  cin >> (A + 1);
  H[0] = 1, U[0] = 2;
  for (int i = 1; i <= N; i++) {
    if (A[i] == '0') {
      H[i] = (H[i - 1] * H2 + H3) % MOD;
      U[i] = (U[i - 1] * H2 + H3) % MOD;
    } else {
      H[i] = (MOD + H1 - H[i - 1]) % MOD;
      U[i] = (MOD + H1 - U[i - 1]) % MOD;
    }
  }
  int q;
  cin >> q;
  while (q--) {
    int l, r, len;
    cin >> l >> r >> len;
    if (Hval(l, l + len - 1) == Hval(r, r + len - 1)) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }
  return 0;
}
