#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, m, Q, a1[N], a2[N], b1[N], b2[N];
char S[N], T[N];
int main() {
  scanf("%s%s", S + 1, T + 1);
  n = strlen(S + 1);
  m = strlen(T + 1);
  for (int i = 1; i <= n; ++i) {
    b1[i] = b1[i - 1] + (S[i] != 'A');
    a1[i] = (S[i] == 'A' ? a1[i - 1] + 1 : 0);
  }
  for (int i = 1; i <= m; ++i) {
    b2[i] = b2[i - 1] + (T[i] != 'A');
    a2[i] = (T[i] == 'A' ? a2[i - 1] + 1 : 0);
  }
  scanf("%d", &Q);
  while (Q--) {
    int a, b, c, d;
    scanf("%d%d%d%d", &a, &b, &c, &d);
    int sa = min(b - a + 1, a1[b]), ta = min(d - c + 1, a2[d]), aa = ta - sa;
    int sb = b1[b] - b1[a - 1], tb = b2[d] - b2[c - 1], bb = tb - sb;
    if ((bb & 1) || bb < 0 || aa > 0 || tb && !sb && !aa)
      putchar('0');
    else if (bb)
      putchar('1');
    else if (aa % 3 == 0)
      putchar('1');
    else
      putchar('0');
  }
  return 0;
}
