#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
string s, t;
int a[N], b[N], l1, r1, l2, r2, q, f[N], z[N];
int main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> s >> t;
  int n = int(s.size());
  int m = int(t.size());
  s = " " + s;
  t = " " + t;
  for (int i = 1; i <= n; ++i) {
    if (s[i] == 'A') f[i] = f[i - 1] + 1;
    b[i] = b[i - 1] + (s[i] == 'B' || s[i] == 'C');
  }
  for (int i = 1; i <= m; ++i) {
    if (t[i] == 'A') z[i] = z[i - 1] + 1;
    a[i] = a[i - 1] + (t[i] == 'B' || t[i] == 'C');
  }
  cin >> q;
  for (int i = 1; i <= q; ++i) {
    cin >> l1 >> r1 >> l2 >> r2;
    int cnt1 = b[r1] - b[l1 - 1];
    int cnt2 = a[r2] - a[l2 - 1];
    if (cnt1 > cnt2) {
      cout << 0;
      continue;
    }
    if ((cnt2 - cnt1) % 2 == 1) {
      cout << 0;
      continue;
    }
    if (!cnt1 && !cnt2) {
      if (r2 - l2 > r1 - l1)
        cout << 0;
      else {
        if ((r1 - l1 - r2 + l2) % 3 == 0)
          cout << 1;
        else
          cout << 0;
      }
      continue;
    }
    if (cnt1 == cnt2) {
      if (z[r2] > f[r1])
        cout << 0;
      else {
        if ((f[r1] - z[r2]) % 3 == 0)
          cout << 1;
        else
          cout << 0;
      }
      continue;
    }
    if (cnt1)
      cout << (f[r1] >= z[r2]);
    else
      cout << ((r1 - l1 + 1) > z[r2]);
  }
  return 0;
}
