#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, m, q;
char s[N], t[N];
int pre_s[N], pre_t[N];
int suf_s[N], suf_t[N];
int main() {
  scanf("%s", s + 1), n = strlen(s + 1);
  scanf("%s", t + 1), m = strlen(t + 1);
  for (int i = 1; i <= n; i++)
    pre_s[i] = pre_s[i - 1] + (s[i] == 'A' ? 0 : 1),
    suf_s[i] = (s[i] == 'A' ? suf_s[i - 1] + 1 : 0);
  for (int i = 1; i <= m; i++)
    pre_t[i] = pre_t[i - 1] + (t[i] == 'A' ? 0 : 1),
    suf_t[i] = (t[i] == 'A' ? suf_t[i - 1] + 1 : 0);
  scanf("%d", &q);
  while (q--) {
    int ls, rs, lt, rt;
    scanf("%d%d%d%d", &ls, &rs, &lt, &rt);
    int pres = pre_s[rs] - pre_s[ls - 1];
    int sufs = min(suf_s[rs], rs - ls + 1);
    int pret = pre_t[rt] - pre_t[lt - 1];
    int suft = min(suf_t[rt], rt - lt + 1);
    if (pres % 2 == pret % 2 && pres <= pret &&
        ((sufs > suft && pres < pret) ||
         (sufs >= suft && sufs % 3 == suft % 3)))
      if (sufs == suft && pres == 0 && pret > 0)
        putchar('0');
      else
        putchar('1');
    else
      putchar('0');
  }
  return 0;
}
