#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template <typename T>
using vc = std::vector<T>;
void solve(istream& cin, ostream& cout) {
  string s, t;
  cin >> s >> t;
  int n = s.size();
  int m = t.size();
  vector<int> ss(n), st(m);
  vector<int> ls(n), lt(m);
  for (int i = (0); i < int(n); ++i) {
    if (s[i] != 'A') {
      ss[i] = 1;
    } else {
      ls[i] = 1;
      if (i) {
        ls[i] += ls[i - 1];
      }
    }
    if (i) {
      ss[i] += ss[i - 1];
    }
  }
  for (int i = (0); i < int(m); ++i) {
    if (t[i] != 'A') {
      st[i] = 1;
    } else {
      lt[i] = 1;
      if (i) {
        lt[i] += lt[i - 1];
      }
    }
    if (i) {
      st[i] += st[i - 1];
    }
  }
  int q;
  cin >> q;
  for (int iq = (0); iq < int(q); ++iq) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    --a;
    --b;
    --c;
    --d;
    int x1 = ss[b];
    if (a) {
      x1 -= ss[a - 1];
    }
    int x2 = st[d];
    if (c) {
      x2 -= st[c - 1];
    }
    int l1 = min(ls[b], b - a + 1);
    int l2 = min(lt[d], d - c + 1);
    if (x1 > x2) {
      cout << 0;
      continue;
    }
    if (l1 < l2) {
      cout << 0;
      continue;
    }
    if (x1 == x2) {
      if (l1 % 3 != l2 % 3) {
        cout << 0;
        continue;
      }
      cout << 1;
      continue;
    }
    if (x1 == 0 && l1 == l2 && l1 != 0) {
      cout << 0;
      continue;
    }
    if (x2 % 2 != x1 % 2) {
      cout << 0;
      continue;
    }
    cout << 1;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve(cin, cout);
  return 0;
}
