#include <bits/stdc++.h>
using namespace std;
const double g = 10.0, eps = 1e-12;
const int N = 100000 + 10, maxn = 2000 + 10, inf = 0x3f3f3f3f,
          INF = 0x3f3f3f3f3f3f3f3f;
char s[N], p[N];
int sums[N], sump[N];
int lens, lenp;
int cal(int l, int r, int op) {
  int tel = l - 1, ter = r + 1;
  while (tel < ter - 1) {
    int m = (tel + ter) >> 1;
    if (op == 1) {
      if (sums[m] - sums[r + 1] >= r - m + 1)
        ter = m;
      else
        tel = m;
    } else {
      if (sump[m] - sump[r + 1] >= r - m + 1)
        ter = m;
      else
        tel = m;
    }
  }
  return tel;
}
bool solve(int l1, int r1, int l2, int r2) {
  int lastb1 = cal(l1, r1, 1);
  int lastb2 = cal(l2, r2, 2);
  int a1 = r1 - lastb1, a2 = r2 - lastb2;
  int b1 = lastb1 - l1 + 1, b2 = lastb2 - l2 + 1;
  b1 -= (sums[l1] - sums[lastb1 + 1]);
  b2 -= (sump[l2] - sump[lastb2 + 1]);
  if (a1 > a2) {
    int te1 = b1 + 2, te2 = b2;
    int te3 = b1, te4 = b2;
    if (te1 <= te2 && (te2 - te1) % 2 == 0)
      return 1;
    else if ((a1 - a2) % 3 == 0 && te3 <= te4 && (te4 - te3) % 2 == 0)
      return 1;
    else
      return 0;
  } else if (a1 == a2) {
    if (b1 == 0 && b2 != 0)
      return 0;
    else if (b1 <= b2 && (b2 - b1) % 2 == 0)
      return 1;
  }
  return 0;
}
int main() {
  scanf("%s%s", s + 1, p + 1);
  lens = strlen(s + 1), lenp = strlen(p + 1);
  for (int i = lens; i >= 0; i--) {
    if (s[i] == 'A')
      sums[i] = sums[i + 1] + 1;
    else
      sums[i] = sums[i + 1];
  }
  for (int i = lenp; i >= 0; i--) {
    if (p[i] == 'A')
      sump[i] = sump[i + 1] + 1;
    else
      sump[i] = sump[i + 1];
  }
  int q;
  scanf("%d", &q);
  while (q--) {
    int l1, r1, l2, r2;
    scanf("%d%d%d%d", &l1, &r1, &l2, &r2);
    if (solve(l1, r1, l2, r2))
      printf("1");
    else
      printf("0");
  }
  puts("");
  return 0;
}
