#include <bits/stdc++.h>
using namespace std;
string ans, s[2];
int q, numa[2][100010], sumb[2][100010];
char solve(int numa1, int sumb1, int numa2, int sumb2) {
  if (numa1 < numa2) return '0';
  if (!sumb1 && sumb2) {
    if (numa1 == numa2) return '0';
    sumb1 += 2;
  } else if ((numa1 - numa2) % 3 != 0) {
    sumb1 += 2;
  }
  if (sumb1 > sumb2 || (sumb2 - sumb1) % 2 == 1) return '0';
  return '1';
}
int main() {
  ios::sync_with_stdio(false);
  cin >> s[0] >> s[1];
  for (int i = 0; i < 2; i++) {
    for (int j = 1; j <= s[i].length(); j++) {
      sumb[i][j] = sumb[i][j - 1] + (s[i][j - 1] != 'A');
      numa[i][j] = (s[i][j - 1] == 'A') ? numa[i][j - 1] + 1 : 0;
    }
  }
  cin >> q;
  while (q--) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    int numa1 = min(b - a + 1, numa[0][b]);
    int numa2 = min(d - c + 1, numa[1][d]);
    int sumb1 = sumb[0][b] - sumb[0][a - 1];
    int sumb2 = sumb[1][d] - sumb[1][c - 1];
    ans += solve(numa1, sumb1, numa2, sumb2);
  }
  cout << ans << endl;
  return 0;
}
