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'.
#include <bits/stdc++.h>
using namespace std;
int n, m, q;
const int N = 2e5 + 88;
char s[N], t[N];
int ms[N], mt[N], sums[N], sumt[N];
int main() {
  scanf("%s%s", s + 1, t + 1);
  n = strlen(s + 1);
  m = strlen(t + 1);
  for (int i = 1; i <= n; i++)
    sums[i] = sums[i - 1] + (s[i] != 'A'),
    ms[i] = s[i] == 'A' ? ms[i - 1] + 1 : 0;
  for (int i = 1; i <= m; i++)
    sumt[i] = sumt[i - 1] + (t[i] != 'A'),
    mt[i] = t[i] == 'A' ? mt[i - 1] + 1 : 0;
  scanf("%d", &q);
  while (q--) {
    int x1, y1, x2, y2;
    scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
    int ss = sums[y1] - sums[x1 - 1], tt = sumt[y2] - sumt[x2 - 1];
    if (((ss & 1) ^ (tt & 1)) || ss > tt) {
      putchar('0');
      continue;
    }
    int aa = min(ms[y1], y1 - x1 + 1) - min(mt[y2], y2 - x2 + 1);
    if (aa < 0) {
      putchar('0');
      continue;
    }
    if (tt == ss) {
      if (aa % 3)
        putchar('0');
      else
        putchar('1');
    } else {
      if (aa || ss)
        putchar('1');
      else
        putchar('0');
    }
  }
  return 0;
}
