#include <bits/stdc++.h>
using namespace std;
char s[100005], t[100005];
int o[2][100005], b[2][100005], p[2][100005];
int main() {
  int i, j, k, l, tmp, ii;
  scanf("%s", s);
  scanf("%s", t);
  for (i = 1; s[i - 1] != '\0'; i++) {
    if (s[i - 1] == 'A') {
      o[0][i] = o[0][i - 1] + 1;
      b[0][i] = b[0][i - 1];
      p[0][i] = p[0][i - 1];
    } else {
      p[0][i] = i;
      o[0][i] = o[0][i - 1];
      b[0][i] = b[0][i - 1] + 1;
    }
  }
  for (i = 1; t[i - 1] != '\0'; i++) {
    if (t[i - 1] == 'A') {
      o[1][i] = o[1][i - 1] + 1;
      b[1][i] = b[1][i - 1];
      p[1][i] = p[1][i - 1];
    } else {
      p[1][i] = i;
      o[1][i] = o[1][i - 1];
      b[1][i] = b[1][i - 1] + 1;
    }
  }
  int q;
  scanf("%d", &q);
  while (q--) {
    scanf("%d %d %d", &i, &j, &k);
    scanf("%d", &l);
    if (b[0][j] - b[0][i - 1] > b[1][l] - b[1][k - 1] ||
        (b[1][l] - b[1][k - 1] - (b[0][j] - b[0][i - 1])) % 2 == 1) {
      printf("0");
      continue;
    }
    tmp = b[1][l] - b[1][k - 1] - (b[0][j] - b[0][i - 1]);
    ii = i;
    i = max(i - 1, p[0][j]);
    k = max(k - 1, p[1][l]);
    if (o[0][j] - o[0][i] < o[1][l] - o[1][k]) {
      printf("0");
      continue;
    } else if (tmp == 0 && (o[0][j] - o[0][i] - (o[1][l] - o[1][k])) % 3 != 0) {
      printf("0");
      continue;
    } else if (tmp > 0 && o[0][j] - o[0][i] == o[1][l] - o[1][k] &&
               b[0][j] - b[0][ii - 1] == 0) {
      printf("0");
      continue;
    }
    printf("1");
  }
  return 0;
}
