#include <bits/stdc++.h>
using namespace std;
const int iinf = 1e9 + 10;
const long long inf = 1ll << 60;
const long long mod = 1e9 + 7;
void GG() {
  cout << "0\n";
  exit(0);
}
long long mpow(long long a, long long n, long long mo = mod) {
  long long re = 1;
  while (n > 0) {
    if (n & 1) re = re * a % mo;
    a = a * a % mo;
    n >>= 1;
  }
  return re;
}
long long inv(long long b, long long mo = mod) {
  if (b == 1) return b;
  return (mo - mo / b) * inv(mo % b) % mo;
}
const int maxn = 1e5 + 5;
int p[maxn], q[maxn];
int ta[maxn], sa[maxn];
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  string second, t;
  cin >> second >> t;
  int n = second.length(), m = t.length();
  for (int i = 0; i < n; ++i) {
    p[i + 1] = second[i] != 'A';
    p[i + 1] += p[i];
    if (second[i] == 'A') {
      sa[i + 1] = sa[i] + 1;
    } else {
      sa[i + 1] = 0;
    }
  }
  for (int i = 0; i < m; ++i) {
    q[i + 1] = t[i] != 'A';
    q[i + 1] += q[i];
    if (t[i] == 'A') {
      ta[i + 1] = ta[i] + 1;
    } else {
      ta[i + 1] = 0;
    };
  }
  int Q;
  cin >> Q;
  while (Q--) {
    int l, r, L, R;
    cin >> l >> r >> L >> R;
    int a = p[r] - p[l - 1], b = q[R] - q[L - 1];
    ;
    if ((a % 2 != b % 2) || a > b)
      cout << 0;
    else {
      int SA = min(sa[r], r - l + 1);
      int TA = min(ta[R], R - L + 1);
      ;
      if (((a == b) && (SA % 3 != TA % 3)) || (SA < TA))
        cout << 0;
      else {
        if (a == 0 && b != 0 && (SA - 1 < TA))
          cout << 0;
        else
          cout << 1;
      }
    }
  }
}
