#include <bits/stdc++.h>
using namespace std;
char check(int& a, int& b, int& c, int& d, vector<int>& cnt_s,
           vector<int>& cnt_t, vector<int>& con_s, vector<int>& con_t) {
  int Con_s = min(con_s[b], b - a + 1), Con_t = min(con_t[d], d - c + 1);
  if (Con_s < Con_t) return '0';
  int Cnt_s = cnt_s[b] - cnt_s[a - 1], Cnt_t = cnt_t[d] - cnt_t[c - 1];
  if (Con_s > Con_t) {
    if ((Con_s - Con_t) % 3) Cnt_s += 2;
  }
  if (Cnt_s > Cnt_t || (Cnt_t % 2 != Cnt_s % 2) ||
      (Con_s == Con_t && !Cnt_s && Cnt_t))
    return '0';
  else
    return '1';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  string s, t;
  cin >> s >> t;
  s = '*' + s;
  t = '*' + t;
  vector<int> cnt_s(s.size()), cnt_t(t.size());
  cnt_s[0] = cnt_t[0] = 0;
  for (int i = 1; i < s.size(); ++i) cnt_s[i] = cnt_s[i - 1] + (s[i] != 'A');
  for (int i = 1; i < t.size(); ++i) cnt_t[i] = cnt_t[i - 1] + (t[i] != 'A');
  vector<int> con_s(s.size()), con_t(t.size());
  con_s[1] = (s[1] == 'A');
  con_t[1] = (t[1] == 'A');
  for (int i = 2; i < s.size(); ++i)
    con_s[i] = (s[i] == 'A') ? (con_s[i - 1] + 1) : 0;
  for (int i = 2; i < t.size(); ++i)
    con_t[i] = (t[i] == 'A') ? (con_t[i - 1] + 1) : 0;
  int q;
  cin >> q;
  string ans(q, '1');
  while (q--) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    ans[q] = check(a, b, c, d, cnt_s, cnt_t, con_s, con_t);
  }
  reverse(ans.begin(), ans.end());
  cout << ans;
  return 0;
}
