#include <bits/stdc++.h>
using namespace std;
const int N = 1E5 + 5;
int s[N][2], pre[N][2], cnt[N][2], len[2], T, l, r, t, w;
void Init() {
  for (int i = 0; i <= 1; i++) {
    char c = getchar();
    while ('A' <= c && c <= 'C') {
      s[++len[i]][i] = c - 'A';
      pre[len[i]][i] = pre[len[i] - 1][i];
      if (c - 'A') {
        pre[len[i]][i]++;
      }
      c = getchar();
    }
    scanf("\n");
  }
  for (int i = 0; i <= 1; i++) {
    int last = 0;
    for (int j = 1; j <= len[i]; j++) {
      if (s[j][i]) last = j;
      cnt[j][i] = j - last;
    }
  }
}
void Work() {
  scanf("%d", &T);
  while (T--) {
    scanf("%d%d%d%d", &l, &r, &t, &w);
    int tmp1 = pre[r][0] - pre[l - 1][0];
    int tmp2 = pre[w][1] - pre[t - 1][1];
    if (tmp1 > tmp2) {
      printf("0");
      continue;
    }
    if (tmp1 % 2 != tmp2 % 2) {
      printf("0");
      continue;
    }
    int cnt1 = cnt[r][0];
    cnt1 = min(cnt1, r - l + 1);
    int cnt2 = cnt[w][1];
    cnt2 = min(cnt2, w - t + 1);
    if (cnt1 < cnt2) {
      printf("0");
      continue;
    }
    if (tmp1 == tmp2 && cnt1 % 3 != cnt2 % 3) {
      printf("0");
      continue;
    }
    if (tmp1 != tmp2 && tmp1 == 0 && cnt1 == cnt2) {
      printf("0");
      continue;
    }
    printf("1");
  }
}
int main() {
  Init();
  Work();
  return 0;
}
