#include <bits/stdc++.h>
using namespace std;
int ns, nt;
string s, t;
int ScntB[100010], ScntA[100010];
int TcntB[100010], TcntA[100010];
int q;
int sol(int ls, int rs, int lt, int rt) {
  int dbS, dbT, daS, daT;
  dbS = ScntB[rs] - ScntB[ls - 1];
  dbT = TcntB[rt] - TcntB[lt - 1];
  daS = min(rs - ls + 1, ScntA[rs]);
  daT = min(rt - lt + 1, TcntA[rt]);
  if (daS < daT) return 0;
  if ((dbS + dbT) & 1) return 0;
  if (dbS > dbT) return 0;
  if (dbS == dbT) {
    if (daS % 3 == daT % 3) return 1;
    return 0;
  }
  if (dbS == 0 && daS == daT) return 0;
  return 1;
}
int main() {
  cin >> s;
  cin >> t;
  ns = s.length();
  nt = t.length();
  for (int i = 0; i < ns; i++) {
    ScntB[i + 1] = ScntB[i];
    if (s[i] == 'A') {
      if (i > 0 && s[i - 1] == 'A')
        ScntA[i + 1] = ScntA[i] + 1;
      else
        ScntA[i + 1] = 1;
    } else
      ScntB[i + 1] += 1;
  }
  for (int i = 0; i < nt; i++) {
    TcntB[i + 1] = TcntB[i];
    if (t[i] == 'A') {
      if (i > 0 && t[i - 1] == 'A')
        TcntA[i + 1] = TcntA[i] + 1;
      else
        TcntA[i + 1] = 1;
    } else
      TcntB[i + 1] += 1;
  }
  cin >> q;
  for (int i = 1; i <= q; i++) {
    int ls, rs, lt, rt;
    cin >> ls >> rs >> lt >> rt;
    cout << sol(ls, rs, lt, rt);
  }
  return 0;
}
