#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-6;
const int N = 1 << 17;
char S[N], T[N];
int AS[N], AT[N], BS[N], BT[N];
int main() {
  cin >> (S + 1) >> (T + 1);
  int n = strlen(S + 1), m = strlen(T + 1);
  for (int i = 1; i <= n; i++) {
    AS[i] = S[i] == 'A' ? AS[i - 1] + 1 : 0;
    BS[i] = BS[i - 1] + (S[i] == 'B' || S[i] == 'C');
  }
  for (int i = 1; i <= m; i++) {
    AT[i] = T[i] == 'A' ? AT[i - 1] + 1 : 0;
    BT[i] = BT[i - 1] + (T[i] == 'B' || T[i] == 'C');
  }
  int q;
  cin >> q;
  while (q--) {
    static int a, b, c, d;
    cin >> a >> b >> c >> d;
    int ss = BS[b] - BS[a - 1];
    int tt = BT[d] - BT[c - 1];
    if (ss > tt || (ss & 1) ^ (tt & 1))
      cout << 0;
    else {
      int x = min(b - a + 1, AS[b]), y = min(d - c + 1, AT[d]);
      if (x < y)
        cout << 0;
      else if (x > y && (x - y) % 3 && ss + 2 > tt)
        cout << 0;
      else if (x == y && x == b - a + 1 && y != d - c + 1)
        cout << 0;
      else
        cout << 1;
    }
  }
  return 0;
}

### Prompt

Your task is to create a CPP solution to the following problem:

Alice has a string consisting of characters 'A', 'B' and 'C'. Bob can use the following transitions on any substring of our string in any order any number of times: 

  * A <image> BC
  * B <image> AC
  * C <image> AB
  * AAA <image> empty string 



Note that a substring is one or more consecutive characters. For given queries, determine whether it is possible to obtain the target string from source.

Input

The first line contains a string S (1 ≤ |S| ≤ 105). The second line contains a string T (1 ≤ |T| ≤ 105), each of these strings consists only of uppercase English letters 'A', 'B' and 'C'.

The third line contains the number of queries Q (1 ≤ Q ≤ 105).

The following Q lines describe queries. The i-th of these lines contains four space separated integers ai, bi, ci, di. These represent the i-th query: is it possible to create T[ci..di] from S[ai..bi] by applying the above transitions finite amount of times?

Here, U[x..y] is a substring of U that begins at index x (indexed from 1) and ends at index y. In particular, U[1..|U|] is the whole string U.

It is guaranteed that 1 ≤ a ≤ b ≤ |S| and 1 ≤ c ≤ d ≤ |T|.

Output

Print a string of Q characters, where the i-th character is '1' if the answer to the i-th query is positive, and '0' otherwise.

Example

Input

AABCCBAAB
ABCB
5
1 3 1 2
2 2 2 4
7 9 1 1
3 4 2 3
4 5 1 3


Output

10011

Note

In the first query we can achieve the result, for instance, by using transitions <image>.

The third query asks for changing AAB to A — but in this case we are not able to get rid of the character 'B'.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-6;
const int N = 1 << 17;
char S[N], T[N];
int AS[N], AT[N], BS[N], BT[N];
int main() {
  cin >> (S + 1) >> (T + 1);
  int n = strlen(S + 1), m = strlen(T + 1);
  for (int i = 1; i <= n; i++) {
    AS[i] = S[i] == 'A' ? AS[i - 1] + 1 : 0;
    BS[i] = BS[i - 1] + (S[i] == 'B' || S[i] == 'C');
  }
  for (int i = 1; i <= m; i++) {
    AT[i] = T[i] == 'A' ? AT[i - 1] + 1 : 0;
    BT[i] = BT[i - 1] + (T[i] == 'B' || T[i] == 'C');
  }
  int q;
  cin >> q;
  while (q--) {
    static int a, b, c, d;
    cin >> a >> b >> c >> d;
    int ss = BS[b] - BS[a - 1];
    int tt = BT[d] - BT[c - 1];
    if (ss > tt || (ss & 1) ^ (tt & 1))
      cout << 0;
    else {
      int x = min(b - a + 1, AS[b]), y = min(d - c + 1, AT[d]);
      if (x < y)
        cout << 0;
      else if (x > y && (x - y) % 3 && ss + 2 > tt)
        cout << 0;
      else if (x == y && x == b - a + 1 && y != d - c + 1)
        cout << 0;
      else
        cout << 1;
    }
  }
  return 0;
}

```