#include <bits/stdc++.h>
using namespace std;
inline void read(long long &x) {
  char ch;
  bool flag = false;
  for (ch = getchar(); !isdigit(ch); ch = getchar())
    if (ch == '-') flag = true;
  for (x = 0; isdigit(ch); x = x * 10 + ch - '0', ch = getchar())
    ;
  x = flag ? -x : x;
}
inline void read(int &x) {
  char ch;
  bool flag = false;
  for (ch = getchar(); !isdigit(ch); ch = getchar())
    if (ch == '-') flag = true;
  for (x = 0; isdigit(ch); x = x * 10 + ch - '0', ch = getchar())
    ;
  x = flag ? -x : x;
}
inline void write(long long x) {
  static const long long maxlen = 100;
  static char s[maxlen];
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  if (!x) {
    putchar('0');
    return;
  }
  long long len = 0;
  for (; x; x /= 10) s[len++] = x % 10 + '0';
  for (long long i = len - 1; i >= 0; --i) putchar(s[i]);
}
int n;
int a[1100000];
int b[1100000];
int pre_a[1100000];
int pre_b[1100000];
char s[1100000];
int main() {
  scanf("%s", s);
  int len1 = strlen(s);
  for (int i = 1; i <= len1; i++)
    if (s[i - 1] == 'A') {
      a[i] = a[i - 1];
      pre_a[i] = pre_a[i - 1] + 1;
    } else {
      a[i] = a[i - 1] + 1;
      pre_a[i] = 0;
    }
  scanf("%s", s);
  int len2 = strlen(s);
  for (int i = 1; i <= len2; i++)
    if (s[i - 1] == 'A') {
      b[i] = b[i - 1];
      pre_b[i] = pre_b[i - 1] + 1;
    } else {
      b[i] = b[i - 1] + 1;
      pre_b[i] = 0;
    }
  read(n);
  for (int i = 1; i <= n; i++) {
    int x, y, t, u;
    read(x);
    read(y);
    read(t);
    read(u);
    if (b[u] - b[t - 1] == 0) {
      printf("%d", (a[y] - a[x - 1] == 0) && (u - t <= y - x) &&
                       ((u - t) % 3 == (y - x) % 3));
      continue;
    }
    if (((a[y] - a[x - 1]) % 2 == (b[u] - b[t - 1]) % 2) &&
        (a[y] - a[x - 1] <= b[u] - b[t - 1]))
      if ((pre_b[u] == 0) &&
          ((a[y] - a[x - 1] < b[u] - b[t - 1]) || (pre_a[y] == 0))) {
        printf("1");
        continue;
      } else if ((pre_b[u] == min(pre_a[y], y - x + 1)) &&
                 (pre_a[y] < y - x + 1)) {
        printf("1");
        continue;
      } else if ((min(pre_a[y], y - x + 1) > pre_b[u]) &&
                 (a[y] - a[x - 1] < b[u] - b[t - 1])) {
        printf("1");
        continue;
      } else if ((min(pre_a[y], y - x + 1) > pre_b[u]) &&
                 (min(pre_a[y], y - x + 1) % 3 == pre_b[u] % 3)) {
        printf("1");
        continue;
      }
    printf("0");
  }
  return 0;
}
