#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:64000000")
const int infi = 1e9 + 7;
const long long infl = 2e18 + 7;
string S, T;
int sum1[100500];
int sum2[100500];
int cnt1[100500], cnt2[100500];
void build(string &s, int *sum, int *cnt) {
  int n = s.size();
  int cnt1 = 0;
  for (int i = 0; i < (n); ++i) {
    if (!s[i])
      sum[i] = 1;
    else
      sum[i] = 0;
    if (i) sum[i] += sum[i - 1];
    if (s[i]) {
      ++cnt1;
    } else
      cnt1 = 0;
    cnt[i] = cnt1;
  }
  return;
}
int get(int *sum, int l, int r) {
  if (l) return sum[r] - sum[l - 1];
  return sum[r];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> S >> T;
  for (int i = 0; i < ((int)S.size()); ++i)
    if (S[i] == 'A')
      S[i] = 1;
    else
      S[i] = 0;
  for (int i = 0; i < ((int)T.size()); ++i)
    if (T[i] == 'A')
      T[i] = 1;
    else
      T[i] = 0;
  build(S, sum1, cnt1);
  build(T, sum2, cnt2);
  int m;
  cin >> m;
  for (int i = 0; i < (m); ++i) {
    int l1, r1, l2, r2;
    cin >> l1 >> r1 >> l2 >> r2;
    --l1, --r1, --l2, --r2;
    int a = get(sum1, l1, r1), b = get(sum2, l2, r2);
    int c1 = cnt1[r1], c2 = cnt2[r2];
    c1 = min(c1, r1 - l1 + 1);
    c2 = min(c2, r2 - l2 + 1);
    if (a % 2 != b % 2 || a > b) {
      cout << 0;
      continue;
    }
    if (S[r1] == 1) {
      if (T[r2] == 1) {
        if (c1 < c2) {
          cout << 0;
          continue;
        }
        if (c1 % 3 != c2 % 3) {
          a += 2;
          if (a > b) {
            cout << 0;
            continue;
          }
          cout << 1;
          continue;
        }
        if (a != 0) {
          cout << 1;
          continue;
        }
        if (b == 0) {
          cout << 1;
          continue;
        }
        if (c2 == c1) {
          cout << 0;
          continue;
        }
        a += 2;
        if (a > b)
          cout << 0;
        else
          cout << 1;
      } else {
        if (a < b) {
          cout << 1;
          continue;
        }
        if (c1 % 3) {
          cout << 0;
          continue;
        }
        if (r1 - l1 + 1 == c1) {
          cout << 0;
          assert(0);
        } else
          cout << 1;
      }
    } else {
      if (T[r2] == 1) {
        cout << 0;
      } else {
        cout << 1;
      }
    }
  }
  return 0;
}
